Linear Programming Relaxations of Quadratically Constrained Quadr.pdf.pdf' (334.18 kB)
Linear Programming Relaxations of Quadratically Constrained Quadratic Programs
journal contribution
posted on 1999-02-01, 00:00 authored by Pietro Belotti, Francois MargotFrancois Margot, Andrea QualizzaWe investigate the use of linear programming tools for solving semidefinite
programming relaxations of quadratically constrained quadratic problems. Classes
of valid linear inequalities are presented, including sparse SDP cuts, and principal minors
SDP cuts. Computational results based on instances from the literature are presented