Mathematical Programming Computation

, Volume 2, Issue 1, pp 1–19

Optimizing a polyhedral-semidefinite relaxation of completely positive programs

Full Length Paper

DOI: 10.1007/s12532-010-0010-8

Cite this article as:
Burer, S. Math. Prog. Comp. (2010) 2: 1. doi:10.1007/s12532-010-0010-8


It has recently been shown (Burer, Math Program 120:479–495, 2009) that a large class of NP-hard nonconvex quadratic programs (NQPs) can be modeled as so-called completely positive programs, i.e., the minimization of a linear function over the convex cone of completely positive matrices subject to linear constraints. Such convex programs are NP-hard in general. A basic tractable relaxation is gotten by approximating the completely positive matrices with doubly nonnegative matrices, i.e., matrices which are both nonnegative and positive semidefinite, resulting in a doubly nonnegative program (DNP). Optimizing a DNP, while polynomial, is expensive in practice for interior-point methods. In this paper, we propose a practically efficient decomposition technique, which approximately solves the DNPs while simultaneously producing lower bounds on the original NQP. We illustrate the effectiveness of our approach for solving the basic relaxation of box-constrained NQPs (BoxQPs) and the quadratic assignment problem. For one quadratic assignment instance, a best-known lower bound is obtained. We also incorporate the lower bounds within a branch-and-bound scheme for solving BoxQPs and the quadratic multiple knapsack problem. In particular, to the best of our knowledge, the resulting algorithm for globally solving BoxQPs is the most efficient to date.


Nonconvex quadratic programRelaxationLinear programmingSemidefinite programmingDecomposition

Mathematics Subject Classification (2000)


Copyright information

© Springer and Mathematical Programming Society 2010

Authors and Affiliations

  1. 1.Department of Management SciencesUniversity of IowaIowa CityUSA