Linear Programming Relaxations of Quadratically Constrained Quadratic Programs
classification
🧮 math.CO
cs.DMmath.OC
keywords
linearprogrammingconstrainedcutspresentedquadraticquadraticallyrelaxations
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.