The MILP Road to MIQCP

This paper surveys results on the NP-hard mixed-integer quadratically constrained programming problem. The focus is strong convex relaxations and valid inequalities, which can become the basis of efficient global techniques. In particular, we discuss relaxations and inequalities arising from the algebraic description of the problem as well as from dynamic procedures based on disjunctive programming. These methods can be viewed as generalizations of techiniques for mixed-integer linear programming. We also present brief computational results to indicate the strength and computational requirements of these methods.

[1]  George B. Dantzig,et al.  Solution of a Large-Scale Traveling-Salesman Problem , 1954, Oper. Res..

[2]  Henryk Minc,et al.  On the Matrix Equation X′X = A , 1962, Proceedings of the Edinburgh Mathematical Society.

[3]  C. E. Lemke,et al.  QUADRATIC FORMS SEMI-DEFINITE OVER CONVEX CONES. , 1967 .

[4]  Robert G. Jeroslow,et al.  There Cannot be any Algorithm for Integer Programming with Quadratic Constraints , 1973, Oper. Res..

[5]  Garth P. McCormick,et al.  Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems , 1976, Math. Program..

[6]  James E. Falk,et al.  Jointly Constrained Biconvex Programming , 1983, Math. Oper. Res..

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

[8]  Manfred W. Padberg,et al.  The boolean quadric polytope: Some characteristics, facets and relatives , 1989, Math. Program..

[9]  Warren P. Adams,et al.  A hierarchy of relaxation between the continuous and convex hull representations , 1990 .

[10]  Hanif D. Sherali,et al.  A Hierarchy of Relaxations Between the Continuous and Convex Hull Representations for Zero-One Programming Problems , 1990, SIAM J. Discret. Math..

[11]  Panos M. Pardalos,et al.  Quadratic programming with one negative eigenvalue is NP-hard , 1991, J. Glob. Optim..

[12]  安藤 毅.  Completely positive matrices , 1991 .

[13]  Alexander Schrijver,et al.  Cones of Matrices and Set-Functions and 0-1 Optimization , 1991, SIAM J. Optim..

[14]  F. Al-Khayyal.  Generalized bilinear programming: Part I. Models, applications and linear programming relaxation , 1992 .

[15]  Immanuel M. Bomze,et al.  Using copositivity for global optimality criteria in concave quadratic programming problems , 1993, Math. Program..

[16]  Egon Balas,et al.  A lift-and-project cutting plane algorithm for mixed 0–1 programs , 1993, Math. Program..

[17]  Nikolaos V. Sahinidis,et al.  BARON: A general purpose global optimization software package , 1996, J. Glob. Optim..

[18]  Tomomi Matsui,et al.  NP-hardness of linear multiplicative programming and related problems , 1996, J. Glob. Optim..

[19]  Warren P. Adams,et al.  A Reformulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Problems , 1998 .

[20]  Egon Balas,et al.  programming: Properties of the convex hull of feasible points * , 1998 .

[21]  Yasutoshi Yajima,et al.  A Polyhedral Approach for Nonconvex Quadratic Programming Problems with Box Constraints , 1998, J. Glob. Optim..

[22]  Gábor Pataki,et al.  On the Rank of Extreme Matrices in Semidefinite Programs and the Multiplicity of Optimal Eigenvalues , 1998, Math. Oper. Res..

[23]  R. Horst,et al.  DC Programming: Overview , 1999 .

[24]  Masakazu Kojima,et al.  Cones of Matrices and Successive Convex Relaxations of Nonconvex Sets , 1999, SIAM J. Optim..

[25]  P. Parrilo.  Structured semidefinite programs and semialgebraic geometry methods in robustness and optimization , 2000 .

[26]  G. Cornuéjols,et al.  Combinatorial optimization : packing and covering , 2001 .

[27]  Jean B. Lasserre,et al.  Global Optimization with Polynomials and the Problem of Moments , 2000, SIAM J. Optim..

[28]  Arkadi Nemirovski,et al.  On Polyhedral Approximations of the Second-Order Cone , 2001, Math. Oper. Res..

[29]  M. Kojima,et al.  Second order cone programming relaxation of nonconvex quadratic optimization problems , 2001 .

[30]  Etienne de Klerk,et al.  Approximation of the Stability Number of a Graph via Copositive Programming , 2002, SIAM J. Optim..

[31]  P. Pardalos,et al.  Global Optimization Algorithms for Linearly Constrained Indefinite Quadratic Problems , 2002 .

[32]  Nikolaos V. Sahinidis,et al.  Convexification and Global Optimization in Continuous and Mixed-Integer Nonlinear Programming , 2002 .

[33]  Shuzhong Zhang,et al.  New Results on Quadratic Minimization , 2003, SIAM J. Optim..

[34]  Shuzhong Zhang,et al.  On Cones of Nonnegative Quadratic Functions , 2003, Math. Oper. Res..

[35]  Monique Laurent,et al.  A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0-1 Programming , 2003, Math. Oper. Res..

[36]  Donald Goldfarb,et al.  Second-order cone programming , 2003, Math. Program..

[37]  Masakazu Kojima,et al.  Exact Solutions of Some Nonconvex Quadratic Optimization Problems via SDP and SOCP Relaxations , 2003, Comput. Optim. Appl..

[38]  Daniel Bienstock,et al.  Subset Algebra Lift Operators for 0-1 Integer Programming , 2004, SIAM J. Optim..

[39]  Jeff T. Linderoth.  A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs , 2005, Math. Program..

[40]  Mohamed A. Ramadan,et al.  On the matrix equation x + AT root(2n, X-1)A = 1 , 2006, Appl. Math. Comput..

[41]  Amir Beck,et al.  Quadratic Matrix Programming , 2006, SIAM J. Optim..

[42]  Franz Rendl,et al.  A Copositive Programming Approach to Graph Partitioning , 2007, SIAM J. Optim..

[43]  Jeff T. Linderoth,et al.  FilMINT: An Outer-Approximation-Based Solver for Nonlinear Mixed Integer Programs , 2008 .

[44]  George L. Nemhauser,et al.  A Lifted Linear Programming Branch-and-Bound Algorithm for Mixed-Integer Conic Quadratic Programs , 2008, INFORMS J. Comput..

[45]  Robert Weismantel,et al.  The Convex Envelope of (n--1)-Convex Functions , 2008, SIAM J. Optim..

[46]  Gérard Cornuéjols,et al.  An algorithmic framework for convex mixed integer nonlinear programs , 2008, Discret. Optim..

[47]  Thorsten Koch,et al.  Constraint Integer Programming: A New Approach to Integrate CP and MIP , 2008, CPAIOR.

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

[49]  Samuel Burer,et al.  Globally solving box-constrained nonconvex quadratic programs with semidefinite-based finite branch-and-bound , 2009, Comput. Optim. Appl..

[50]  Franz Rendl,et al.  Copositive and semidefinite relaxations of the quadratic assignment problem , 2009, Discret. Optim..

[51]  Adam N. Letchford,et al.  On Nonconvex Quadratic Programming with Box Constraints , 2009, SIAM J. Optim..

[52]  William J. Cook,et al.  Solution of a Large-Scale Traveling-Salesman Problem , 1954, 50 Years of Integer Programming.

[53]  Sven Leyffer,et al.  FilMINT: An Outer Approximation-Based Solver for Convex Mixed-Integer Nonlinear Programs , 2010, INFORMS J. Comput..

[54]  Alper Atamtürk,et al.  Conic mixed-integer rounding cuts , 2009, Math. Program..

[55]  Samuel Burer,et al.  Optimizing a polyhedral-semidefinite relaxation of completely positive programs , 2010, Math. Program. Comput..

[56]  Samuel Burer,et al.  Computable representations for convex hulls of low-dimensional quadratic forms , 2010, Math. Program..

[57]  Florian Jarre,et al.  A note on Burer’s copositive representation of mixed-binary QPs , 2010, Optim. Lett..

[58]  Jon Lee,et al.  Convex relaxations of non-convex mixed integer quadratically constrained programs: extended formulations , 2010, Math. Program..

[59]  J. Gallier.  Quadratic Optimization Problems , 2020, Linear Algebra and Optimization with Applications to Machine Learning.

[60]  P. Belotti.  Disjunctive Cuts for Nonconvex MINLP , 2012 .

[61]  Ted K. Ralphs,et al.  Integer and Combinatorial Optimization , 2013 .