422 search results - page 11 / 85 » On Non-Approximability for Quadratic Programs |
OL
2010
13 years 6 months ago
2010
In an important paper, Burer [2] recently showed how to reformulate general mixed-binary quadratic optimization problems (QPs) into copositive programs where a linear functional i...
ICPR
2008
IEEE
14 years 9 months ago
2008
IEEE
A quadratic programming formulation for multiclass image segmentation is investigated. It is proved that, in the convex case, the non-negativity constraint on the recent reported ...
AUTOMATICA
2006
13 years 8 months ago
2006
In some of the recently-developed algorithms for convex parametric quadratic programs it is implicitly assumed that the intersection of the closures of two adjacent critical regio...
MP
2006
13 years 8 months ago
2006
Consider the semidefinite relaxation (SDR) of the quadratic integer program (QIP): := maxx{-1,1}n xT Qx minD-Q 0 trace(D) =:
GECCO
2006
Springer
13 years 11 months ago
2006
Springer
When an evolutionary algorithm addresses a sequence of instances of the same problem, it can seed its population with solutions that it found for previous instances. This techniqu...