Simplified copositive and Lagrangian relaxations for linearly constrained quadratic optimization problems in continuous and binary variables

MaRDI QIDQ2928409zbMATH OpenFDO

Authors Naohiko Arima, Sunyoung Kim, Masakazu Kojima

Publication date 7 November 2014

Published in Pacific Journal of Optimization (Search for Journal in Brave)

Full work available at URL http://www.yokohamapublishers.jp/online2/oppjo/vol10/p437.html

zbMATH Keywords

Lagrangian relaxationnonconvex quadratic optimization0-1 mixed integer programcompletely positive programming relaxationcopositve programming relaxation

Mathematics Subject Classification ID

Quadratic programming (90C20) Convex programming (90C25) Nonconvex programming, global optimization (90C26)

Recommendations

• Lagrangian-conic relaxations. I: A unified framework and its applications to quadratic optimization problems
• Copositive relaxation beats Lagrangian dual bounds in quadratically and linearly constrained quadratic optimization problems
• A Lagrangian-DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems
• Copositive realxation for genera quadratic programming
• Simplified semidefinite and completely positive relaxations

Cited in

(14)

• Copositive relaxation beats Lagrangian dual bounds in quadratically and linearly constrained quadratic optimization problems
• Extension of completely positive cone relaxation to moment cone relaxation for polynomial optimization
• Conic approximation to quadratic optimization with linear complementarity constraints
• Unifying semidefinite and set-copositive relaxations of binary problems and randomization techniques
• Lagrangian-conic relaxations. I: A unified framework and its applications to quadratic optimization problems
• A fresh CP look at mixed-binary QPs: new formulations and relaxations
• Equivalences and differences in conic relaxations of combinatorial quadratic optimization problems
• A robust Lagrangian-DNN method for a class of quadratic optimization problems
• A Lagrangian-DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems
• Notoriously hard (mixed-)binary QPs: empirical evidence on new completely positive approaches
• Simplified semidefinite and completely positive relaxations
• A Newton-bracketing method for a simple conic optimization problem
• Binary quadratic optimization problems that are difficult to solve by conic relaxations
• On the copositive representation of binary and continuous nonconvex quadratic programs

This page was built for publication: Simplified copositive and Lagrangian relaxations for linearly constrained quadratic optimization problems in continuous and binary variables

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2928409)