Grippo, Luigi; Palagi, Laura; Piacentini, Mauro; … - Dipartimento di Ingegneria Informatica, Automatica e … - 2009
We consider low-rank semidefinite programming (LRSDP) relaxations of ±1 quadratic problems that can be formulated as the nonconvex nonlinear programming problem of minimizing a quadratic function subject to separable quadratic equality constraints. We prove the equivalence of the LRSDP problem...