422 search results - page 8 / 85 » On Non-Approximability for Quadratic Programs |
CDC
2010
IEEE
13 years 3 months ago
2010
IEEE
Interior point methods (IPMs) have proven to be an efficient way of solving quadratic programming problems in predictive control. A linear system of equations needs to be solved in...
PPCP
1994
14 years 20 hour ago
1994
MP
2011
13 years 2 months ago
2011
Abstract: We propose a first-order interior-point method for linearly constrained smooth optimization that unifies and extends first-order affine-scaling method and replicator d...
MP
2008
13 years 8 months ago
2008
Abstract We propose primal-dual path-following Mehrotra-type predictorcorrector methods for solving convex quadratic semidefinite programming (QSDP) problems of the form: minX{1 2 ...
ICML
2006
IEEE
14 years 8 months ago
2006
IEEE
Quadratic program relaxations are proposed as an alternative to linear program relaxations and tree reweighted belief propagation for the metric labeling or MAP estimation problem...