Abstract
In an important paper, Burer (Math. Program Ser. A 120:479–495, 2009) recently showed how to reformulate general mixed-binary quadratic optimization problems (QPs) into copositive programs where a linear functional is minimized over a linearly constrained subset of the cone of completely positive matrices. In this note we interpret the implication from a topological point of view, showing that the Minkowski sum of the lifted feasible set and the lifted recession cone gives exactly the closure of the former. We also discuss why feasibility of the copositive program implies feasibility of the original mixed-binary QP, which can be derived from the arguments in Burer (Math. Program Ser. A 120:479–495, 2009) without any further condition.
Article PDF
Avoid common mistakes on your manuscript.
References
Berman A., Shaked-Monderer N.: Completely Positive Matrices. World Scientific, Singapore (2003)
Burer S.: On the copositive representation of binary and continuous nonconvex quadratic programs. Math. Program Ser. A 120(2), 479–495 (2009)
Stoer J., Witzgall C.: Convexity and Optimization in Finite Dimensions, Part 1. Springer, Berlin (1970)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Bomze, I.M., Jarre, F. A note on Burer’s copositive representation of mixed-binary QPs. Optim Lett 4, 465–472 (2010). https://doi.org/10.1007/s11590-010-0174-1
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11590-010-0174-1