Simplified semidefinite and completely positive relaxations

DOI10.1016/J.ORL.2015.09.001zbMATH Open1408.90229OpenAlexW1879219441MaRDI QIDQ1785437FDOQ1785437

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)

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 (3)

• Phase transitions in semidefinite relaxations
• Completely positive and copositive program modelling for quadratic optimization problems
• A simplified completely positive reformulation for binary quadratic programs

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)