, Volume 15, Issue 1, pp 1-17

Approximating Global Quadratic Optimization with Convex Quadratic Constraints

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access


We consider the problem of approximating the global maximum of a quadratic program (QP) subject to convex non-homogeneous quadratic constraints. We prove an approximation quality bound that is related to a condition number of the convex feasible set; and it is the currently best for approximating certain problems, such as quadratic optimization over the assignment polytope, according to the best of our knowledge.