A Slightly Lifted Convex Relaxation for Nonconvex Quadratic Programming with Ball Constraints

Samuel Burer

Globally optimizing a nonconvex quadratic over the intersection of $m$ balls in ${\mathbb{R}}^n$ is known to be polynomial-time solvable for fixed $m$. Moreover, when $m=1$, the stan…