422 search results - page 8 / 85 » On Non-Approximability for Quadratic Programs |
132
click to vote
CDC
2010
IEEE
14 years 10 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...
80
Voted
PPCP
1994
15 years 7 months ago
1994
164
click to vote
MP
2011
14 years 10 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...
119
click to vote
MP
2008
15 years 3 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 ...
158
click to vote
ICML
2006
IEEE
16 years 4 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...