Simplified semidefinite and completely positive relaxations

DOI10.1016/J.ORL.2015.09.001MaRDI QIDQ1785437zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

binarycompletely positivequadratic programsemidefinite

Mathematics Subject Classification ID

Quadratic programming (90C20) Semidefinite programming (90C22)

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

• On the copositive representation of binary and continuous nonconvex quadratic programs
• SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
• 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)

• Burer's key assumption for semidefinite and doubly nonnegative relaxations
• Completely positive and completely positive semidefinite tensor relaxations for polynomial optimization
• On equivalence of semidefinite relaxations for quadratic matrix programming
• Completely positive and copositive program modelling for quadratic optimization problems
• Phase transitions in semidefinite relaxations
• Second Order Cone Programming Relaxation of a Positive Semidefinite Constraint
• Linear programming relaxations of quadratically constrained quadratic programs
• 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
• Fixed point theory for permissible extension type maps
• A simplified completely positive reformulation for binary quadratic programs

Describes a project that uses

Uses Software

• SDPT3
• YALMIP

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)