A fresh CP look at mixed-binary QPs: new formulations and relaxations

DOI10.1007/s10107-017-1109-8zbMath1386.90097OpenAlexW2575524387MaRDI QIDQ1683686

Abdel Lisser, Peter J. C. Dickinson, Jianqiang Cheng, Immanuel M. Bomze

Publication date: 1 December 2017

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10150/632069

zbMATH Keywords

nonlinear optimizationnonconvex optimizationquadratic optimizationcompletely positivecopositivityreformulationsconic optimization

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Quadratic programming (90C20)

Related Items (11)

An exact completely positive programming formulation for the discrete ordered median problem: an extended version ⋮ Doubly nonnegative relaxations are equivalent to completely positive reformulations of quadratic optimization problems with block-clique graph structures ⋮ (Global) optimization: historical notes and recent developments ⋮ Conic optimization: a survey with special focus on copositive optimization and binary quadratic problems ⋮ A Geometrical Analysis on Convex Conic Reformulations of Quadratic and Polynomial Optimization Problems ⋮ Exploiting partial correlations in distributionally robust optimization ⋮ Equivalences and differences in conic relaxations of combinatorial quadratic optimization problems ⋮ Notoriously hard (mixed-)binary QPs: empirical evidence on new completely positive approaches ⋮ Robust Quadratic Programming with Mixed-Integer Uncertainty ⋮ An alternative perspective on copositive and convex relaxations of nonconvex quadratic programs ⋮ Copositive Relaxation Beats Lagrangian Dual Bounds in Quadratically and Linearly Constrained Quadratic Optimization Problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Copositive optimization -- recent developments and applications
• Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization
• On the computational complexity of membership problems for the completely positive cone and its dual
• Optimizing a polyhedral-semidefinite relaxation of completely positive programs
• A note on Burer's copositive representation of mixed-binary QPs
• A gentle, geometric introduction to copositive optimization
• On the copositive representation of binary and continuous nonconvex quadratic programs
• Cones, matrices and mathematical programming
• Copositive Programming
• New results on the cp-rank and related properties of co(mpletely )positive matrices
• New Lower Bounds and Asymptotics for the cp-Rank
• Computing a Sparse Basis for the Null Space
• Some NP-complete problems in quadratic and nonlinear programming
• On the Closedness of the Linear Image of a Closed Convex Cone
• Copositive Relaxation Beats Lagrangian Dual Bounds in Quadratically and Linearly Constrained Quadratic Optimization Problems
• On copositive programming and standard quadratic optimization problems

This page was built for publication: A fresh CP look at mixed-binary QPs: new formulations and relaxations