Polyhedral properties of RLT relaxations of nonconvex quadratic programs and their implications on exact relaxations

Cites Work

Unnamed Item
Analysis of copositive optimization based linear programming bounds on standard quadratic optimization
Enhancing RLT relaxations via a new class of semidefinite cuts
Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons
Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
Quadratic programming with one negative eigenvalue is NP-hard
A new reformulation-linearization technique for bilinear programming problems
A reformulation-linearization technique for solving discrete and continuous nonconvex problems
On standard quadratic optimization problems
Exact solutions of some nonconvex quadratic optimization problems via SDP and SOCP relaxa\-tions
A polyhedral branch-and-cut approach to global optimization
A reformulation-convexification approach for solving nonconvex quadratic programming problems
On convex relaxations for quadratically constrained quadratic programming
A branch and cut algorithm for nonconvex quadratically constrained quadratic programming
An alternative perspective on copositive and convex relaxations of nonconvex quadratic programs
QPLIB: a library of quadratic programming instances
On the copositive representation of binary and continuous nonconvex quadratic programs
Approximation of the Stability Number of a Graph via Copositive Programming
Computationally Related Problems
Copositive Relaxation Beats Lagrangian Dual Bounds in Quadratically and Linearly Constrained Quadratic Optimization Problems
On copositive programming and standard quadratic optimization problems

This page was built for publication: Polyhedral properties of RLT relaxations of nonconvex quadratic programs and their implications on exact relaxations