2000 character limit reached
Linear Programming Relaxations of Quadratically Constrained Quadratic Programs (1206.1633v1)
Published 7 Jun 2012 in math.CO, cs.DM, and math.OC
Abstract: We 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 PSD cuts, and principal minors PSD cuts. Computational results based on instances from the literature are presented.