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

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

Research output: Contribution to journalArticlepeer-review

10 Scopus citations


Triggered by Burer’s seminal characterization from 2009, many copositive reformulations of mixed-binary QPs have been discussed by now. Most of them can be used as proper relaxations, if the intractable co(mpletely)positive cones are replaced by tractable approximations. While the widely used approximation hierarchies have the disadvantage to use positive-semidefinite (psd) matrices of orders which rapidly increase with the level of approximation, alternatives focus on the problem of keeping psd matrix orders small, with the aim to avoid memory problems in the interior point algorithms. This work continues this approach, proposing new reformulations and relaxations. Moreover, we provide a thorough comparison of the respective duals and establish a monotonicity relation among their duality gaps. We also identify sufficient conditions for strong duality/zero duality gap in some of these formulations and generalize some of our observations to general conic problems.

Original languageEnglish (US)
Pages (from-to)159-184
Number of pages26
JournalMathematical Programming
Issue number1-2
StatePublished - Nov 1 2017


  • Completely positive
  • Conic optimization
  • Copositivity
  • Nonconvex optimization
  • Nonlinear optimization
  • Quadratic optimization
  • Reformulations

ASJC Scopus subject areas

  • Software
  • General Mathematics


Dive into the research topics of 'A fresh CP look at mixed-binary QPs: new formulations and relaxations'. Together they form a unique fingerprint.

Cite this