Searching for "Approximation Algorithms for Quadratic Programming." – sorted by Relevance.
-
Approximation Algorithms for Quadratic Programming
- Approximation algorithms for quadratic programming Minyue Fu Department of Electrical
- Cited by 18 (5 self) – Add To MetaCart
-
unknown title
- Approximation algorithms for quadratic programming \Lambda Minyue Fu Department of Electrical
- Add To MetaCart
-
The Complexity of Approximating a Nonlinear Program
- constant �� 2 (0; 1) such that quadratic programming has no polynomial time, ��-approximation algorithm
- Cited by 55 (4 self) – Add To MetaCart
-
Interior-Point Algorithms: 1996 Annual Progress
- -KuhnTucker (KKT) point of general quadratic programming. We show that the algorithm is a fully polynomial
- Add To MetaCart
-
Interior-Point Algorithms: 1996 Annual Progress Report on NSF Grant DMI-9522507
- algorithm to approximate a Karush-KuhnTucker (KKT) point of general quadratic programming. We show
- Add To MetaCart
-
Coresets for Polytope Distance ∗
- an instance of the Frank Wolfe approximation algorithm for quadratic programs [11], which is now often called
- Add To MetaCart
-
Interior-Point Algorithms: 1997 Annual Progress
- (April, 1996), to appear in Mathematical Programming. [J2] "Approximation algorithms for quadratic
- Add To MetaCart
-
Complexity Issues In Global Optimization: A Survey
- the problem to polynomial. 5. Approximation algorithms in quadratic programming In the last section we
- Cited by 3 (0 self) – Add To MetaCart

