422 search results - page 12 / 85 » On Non-Approximability for Quadratic Programs |
124
Voted
GECCO
2000
Springer
15 years 7 months ago
2000
Springer
In earlier work we predicted program size would grow in the limit at a quadratic rate and up to fty generations we measured bloat O(generations1:2;1:5). On two simple benchmarks w...
109
click to vote
GBRPR
2007
Springer
15 years 9 months ago
2007
Springer
In this paper we propose a quadratic programming approach to computing the edit distance of graphs. Whereas the standard edit distance is defined with respect to a minimum-cost ed...
129
click to vote
APPML
2007
15 years 3 months ago
2007
We present a new strategy for choosing primal and dual steplengths in a primal-dual interior-point algorithm for convex quadratic programming. Current implementations often scale ...
145
click to vote
SIAMSC
2008
15 years 3 months ago
2008
We present a two-phase algorithm for solving large-scale quadratic programs (QPs). In the first phase, gradient-projection iterations approximately minimize an augmented Lagrangian...
117
click to vote
EOR
2007
15 years 3 months ago
2007
The unconstrained quadratic binary program (UQP) is proving to be a successful modeling and solution framework for a variety of combinatorial optimization problems. Experience rep...