Date of Original Version
8-2009
Type
Working Paper
Abstract or Table of Contents
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 SDP cuts, and principal minors SDP cuts. Computational results based on instances from the literature are presented