On exact and inexact RLT and SDP-RLT relaxations of quadratic programs with box constraints

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Exactness conditions for an SDP relaxation of the extended trust region problem
Trust-region problems with linear inequality constraints: exact SDP relaxation, global optimality and robust optimization
Analysis of copositive optimization based linear programming bounds on standard quadratic optimization
Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
The Boolean quadratic polytope: Some characteristics, facets and relatives
Quadratic programming with one negative eigenvalue is NP-hard
A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique
A polyhedral approach for nonconvex quadratic programming problems with box constraints
Exact solutions of some nonconvex quadratic optimization problems via SDP and SOCP relaxa\-tions
Globally solving nonconvex quadratic programming problems with box constraints via integer programming methods
A polyhedral branch-and-cut approach to global optimization
On convex relaxations for quadratically constrained quadratic programming
An alternative perspective on copositive and convex relaxations of nonconvex quadratic programs
On the complexity of finding a local minimizer of a quadratic function over a polytope
Exact SDP relaxations of quadratically constrained quadratic programs with forest structures
On the tightness of SDP relaxations of QCQPs
On standard quadratic programs with exact and inexact doubly nonnegative relaxations
Exact semidefinite formulations for a class of (random and non-random) nonconvex quadratic programs
ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
Computable representations for convex hulls of low-dimensional quadratic forms
Julia: A Fresh Approach to Numerical Computing
On Nonconvex Quadratic Programming with Box Constraints
The polynomial solvability of convex quadratic programming
Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
Semidefinite Programming
On Valid Inequalities for Quadratic Programming with Continuous Variables and Binary Indicators
Computationally Related Problems
Exactness of Semidefinite Relaxations for Nonlinear Optimization Problems with Underlying Graph Structure
A Second-Order Cone Based Approach for Solving the Trust-Region Subproblem and Its Variants
On Connections Between Zero-One Integer Programming and Concave Programming Under Linear Constraints
Convex Analysis
Optimality conditions for quadratic programming
Introduction to global optimization.
JuMP 1.0: recent improvements to a modeling language for mathematical optimization

This page was built for publication: On exact and inexact RLT and SDP-RLT relaxations of quadratic programs with box constraints