Globally solving nonconvex quadratic programming problems via completely positive programming

Nonconvex quadratic programming (QP) is an NP-hard problem that optimizes a general quadratic function over linear constraints. This paper introduces a new global optimization algorithm for this problem, which combines two ideas from the literature—finite branching based on the first-order KKT conditions and polyhedral-semidefinite relaxations of completely positive (or copositive) programs. Through a series of computational experiments comparing the new algorithm with existing codes on a diverse set of test instances, we demonstrate that the new algorithm is an attractive method for globally solving nonconvex QP.

[1]  P. Toint,et al.  Numerical Methods for Large-Scale Non-Convex Quadratic Programming , 2002 .

[2]  C. Cryer,et al.  An alternating direction implicit algorithm for the solution of linear complementarity problems arising from free boundary problems , 1985 .

[3]  Nicholas I. M. Gould,et al.  CUTEr and SifDec: A constrained and unconstrained testing environment, revisited , 2003, TOMS.

[4]  George L. Nemhauser,et al.  A branch-and-cut algorithm for nonconvex quadratic programs with box constraints , 2005, Math. Program..

[5]  Samuel Burer,et al.  Solving Lift-and-Project Relaxations of Binary Integer Programs , 2006, SIAM J. Optim..

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

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

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

[9]  M. R. Celis.  A TRUST REGION STRATEGY FOR NONLINEAR EQUALITY CONSTRAINED OPTIMIZATION (NONLINEAR PROGRAMMING, SEQUENTIAL QUADRATIC) , 1985 .

[10]  J. D. PEARSON.  AN INDEFINITE-QUADRATIC-PROGRAMMING MODEL FORA CONTINUOUS-PRODUCTION PROBLEM , 2014 .

[11]  Jorge J. Moré,et al.  Digital Object Identifier (DOI) 10.1007/s101070100263 , 2001 .

[12]  Martin Skutella,et al.  Convex quadratic and semidefinite programming relaxations in scheduling , 2001, JACM.

[13]  Stephen J. Wright,et al.  Numerical Optimization , 2018, Fundamental Statistical Inference.

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

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

[16]  Panos M. Pardalos,et al.  GLOBAL OPTIMIZATION ALGORITHMS FOR LINEARLY CONSTRAINED INDEFINITE QUADRATIC PROBLEMS , 1991 .

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

[18]  Leo Liberti,et al.  Branching and bounds tighteningtechniques for non-convex MINLP , 2009, Optim. Methods Softw..

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

[20]  Tri-Dung Nguyen,et al.  Outlier detection and least trimmed squares approximation using semi-definite programming , 2010, Comput. Stat. Data Anal..

[21]  J. J. Moré,et al.  Algorithms for bound constrained quadratic programming problems , 1989 .

[22]  Samuel Burer,et al.  A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations , 2008, Math. Program..