Simplified semidefinite and completely positive relaxations
From MaRDI portal
Publication:1785437
DOI10.1016/J.ORL.2015.09.001zbMATH Open1408.90229OpenAlexW1879219441MaRDI QIDQ1785437FDOQ1785437
Authors: Felix Lieder 
Publication date: 28 September 2018
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2015.09.001
Recommendations
- Linear programming relaxations of quadratically constrained quadratic programs
- Semidefinite programming relaxation for nonconvex quadratic programs
- Copositive realxation for genera quadratic programming
- On equivalence of semidefinite relaxations for quadratic matrix programming
- Burer's key assumption for semidefinite and doubly nonnegative relaxations
Cites Work
- SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
- On the copositive representation of binary and continuous nonconvex quadratic programs
- Simplified copositive and Lagrangian relaxations for linearly constrained quadratic optimization problems in continuous and binary variables
- Unifying semidefinite and set-copositive relaxations of binary problems and randomization techniques
Cited In (11)
- Phase transitions in semidefinite relaxations
- Completely positive and copositive program modelling for quadratic optimization problems
- Burer's key assumption for semidefinite and doubly nonnegative relaxations
- Fixed point theory for permissible extension type maps
- Simplified copositive and Lagrangian relaxations for linearly constrained quadratic optimization problems in continuous and binary variables
- A fresh CP look at mixed-binary QPs: new formulations and relaxations
- On equivalence of semidefinite relaxations for quadratic matrix programming
- Linear programming relaxations of quadratically constrained quadratic programs
- Second Order Cone Programming Relaxation of a Positive Semidefinite Constraint
- A simplified completely positive reformulation for binary quadratic programs
- Completely positive and completely positive semidefinite tensor relaxations for polynomial optimization
Uses Software
This page was built for publication: Simplified semidefinite and completely positive relaxations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1785437)
