Inner approximations of completely positive reformulations of mixed binary quadratic programs: a unified analysis

Every quadratic programming problem with a mix of continuous and binary variables can be equivalently reformulated as a completely positive optimization problem, that is, a linear optimization problem over the convex but computationally intractable cone of completely positive matrices. In this paper, we focus on general inner approximations of the cone of completely positive matrices on instances of completely positive optimization problems that arise from the reformulation of mixed binary quadratic programming problems. We provide a characterization of the feasibility of such an inner approximation as well as the optimal value of a feasible inner approximation. In particular, our results imply that polyhedral inner approximations are equivalent to a finite discretization of the feasible region of the original completely positive optimization problem. Our characterization yields, as a byproduct, an upper bound on the gap between the optimal value of an inner approximation and that of the original instance. We discuss the implications of this error bound for standard and box-constrained quadratic programs as well as general mixed binary quadratic programs with a bounded feasible region.

[1]  Peter J. C. Dickinson,et al.  On the computational complexity of membership problems for the completely positive cone and its dual , 2014, Comput. Optim. Appl..

[2]  Etienne de Klerk,et al.  An Error Analysis for Polynomial Optimization over the Simplex Based on the Multivariate Hypergeometric Distribution , 2015, SIAM J. Optim..

[3]  Etienne de Klerk,et al.  On Copositive Programming and Standard Quadratic Optimization Problems , 2000, J. Glob. Optim..

[4]  Jean B. Lasserre,et al.  New approximations for the cone of copositive matrices and its dual , 2010, Mathematical Programming.

[5]  Immanuel M. Bomze,et al.  On Standard Quadratic Optimization Problems , 1998, J. Glob. Optim..

[6]  Samuel Burer,et al.  On the copositive representation of binary and continuous nonconvex quadratic programs , 2009, Math. Program..

[7]  Stanislav Busygin,et al.  Copositive Programming , 2009, Encyclopedia of Optimization.

[8]  Panos M. Pardalos,et al.  Quadratic Programming with Box Constraints , 1997 .

[9]  E. Alper Yildirim,et al.  On the accuracy of uniform polyhedral approximations of the copositive cone , 2012, Optim. Methods Softw..

[10]  Johan Håstad,et al.  Some optimal inapproximability results , 2001, JACM.

[11]  Immanuel M. Bomze,et al.  Rounding on the standard simplex: regular grids for global optimization , 2014, J. Glob. Optim..

[12]  Etienne de Klerk,et al.  Solving Standard Quadratic Optimization Problems via Linear, Semidefinite and Copositive Programming , 2002, J. Glob. Optim..

[13]  Immanuel M. Bomze,et al.  Copositive optimization - Recent developments and applications , 2012, Eur. J. Oper. Res..

[14]  Etienne de Klerk,et al.  The complexity of optimizing over a simplex, hypercube or sphere: a short survey , 2008, Central Eur. J. Oper. Res..

[15]  E. Alper Yildirim,et al.  Analysis of copositive optimization based linear programming bounds on standard quadratic optimization , 2015, J. Glob. Optim..

[16]  Katta G. Murty,et al.  Some NP-complete problems in quadratic and nonlinear programming , 1987, Math. Program..

[17]  Mirjam Dür,et al.  Copositive Programming – a Survey , 2010 .

[18]  A. Berman,et al.  Completely Positive Matrices , 2003 .

[19]  Valeriu Soltan,et al.  Lectures on Convex Sets , 2019 .

[20]  E. Alper Yldrm.  On the Accuracy of Uniform Polyhedral Approximations of the Copositive Cone , 2009 .

[21]  Etienne de Klerk,et al.  An alternative proof of a PTAS for fixed-degree polynomial optimization over the simplex , 2015, Math. Program..

[22]  T. Motzkin,et al.  Maxima for Graphs and a New Proof of a Theorem of Turán , 1965, Canadian Journal of Mathematics.

[23]  Philip Wolfe,et al.  An algorithm for quadratic programming , 1956 .