422 search results - page 7 / 85 » On Non-Approximability for Quadratic Programs |
123
Voted
CVIU
2011
14 years 1 months ago
2011
Quadratic optimization lies at the very heart of many structural pattern recognition and computer vision problems, such as graph matching, object recognition, image segmentation, ...
LATIN
2010
Springer
14 years 8 months ago
2010
Springer
A predicate P : {−1, 1}k → {0, 1} can be associated with a constraint satisfaction problem Max CSP(P). P is called “approximation resistant” if Max CSP(P) cannot be approxi...
74
Voted
SIAMJO
2010
14 years 8 months ago
2010
This paper addresses the need for nonlinear programming algorithms that provide fast local convergence guarantees no matter if a problem is feasible or infeasible. We present an a...
87
Voted
OL
2011
14 years 11 days ago
2011
In this paper we present a methodology for finding tight convex relaxations for a special set of quadratic constraints given by bilinear and linear terms that frequently arise in ...
84
Voted
EOR
2010
14 years 9 months ago
2010
We consider the unrelated parallel machines scheduling problem where jobs have earliness and tardiness penalties and a common due date. We formulate this problem and some of its v...