Equivalences and differences in conic relaxations of combinatorial quadratic optimization problems
From MaRDI portal
Publication:1756793
DOI10.1007/s10898-018-0676-4zbMath1404.90096OpenAlexW2809623894MaRDI QIDQ1756793
Kim-Chuan Toh, Akiko Takeda, Sunyoung Kim, N. Ito, Kojima, Masakazu
Publication date: 27 December 2018
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-018-0676-4
semidefinite relaxationsnondegeneracycompletely positive relaxationsbinary and complementarity conditioncombinatorial quadratic optimization problemsdoubly nonnegative relaxationsequivalence of feasible regions
Semidefinite programming (90C22) Convex programming (90C25) Nonconvex programming, global optimization (90C26) Quadratic programming (90C20)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Solving semidefinite-quadratic-linear programs using SDPT3
- A Lagrangian-DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems
- SDPNAL+: a majorized semismooth Newton-CG augmented Lagrangian method for semidefinite programming with nonnegative constraints
- A robust Lagrangian-DNN method for a class of quadratic optimization problems
- Copositive and semidefinite relaxations of the quadratic assignment problem
- Bounds for the quadratic assignment problem using the bundle method
- Complementarity and nondegeneracy in semidefinite programming
- Local convergence of predictor-corrector infeasible-interior-point algorithms for SDPs and SDLCPs
- Semidefinite programming relaxations for the quadratic assignment problem
- A fresh CP look at mixed-binary QPs: new formulations and relaxations
- Binary quadratic optimization problems that are difficult to solve by conic relaxations
- Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming
- A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming
- On the copositive representation of binary and continuous nonconvex quadratic programs
- On Lagrangian Relaxation of Quadratic Matrix Constraints
- Approximation of the Stability Number of a Graph via Copositive Programming
- Local structure of feasible sets in nonlinear programming, part II: Nondegeneracy
- Some NP-complete problems in quadratic and nonlinear programming
- A Quadratically Constrained Quadratic Optimization Model for Completely Positive Cone Programming
- A Copositive Programming Approach to Graph Partitioning
- On copositive programming and standard quadratic optimization problems
