A new algorithm for concave quadratic programming

AbstractThe main outcomes of the paper are divided into two parts. First, we present a new dual for quadratic programs, in which, the dual variables are affine functions, and we prove strong duality. Since the new dual is intractable, we consider a modified version by restricting the feasible set. This leads to a new bound for quadratic programs. We demonstrate that the dual of the bound is a semi-definite relaxation of quadratic programs. In addition, we probe the relationship between this bound and the well-known bounds in the literature. In the second part, thanks to the new bound, we propose a branch and cut algorithm for concave quadratic programs. We establish that the algorithm enjoys global convergence. The effectiveness of the method is illustrated for numerical problem instances.

[1]  N. Shor.  Dual quadratic estimates in polynomial and Boolean programming , 1991 .

[2]  Samuel Burer,et al.  Globally solving nonconvex quadratic programming problems via completely positive programming , 2011, Mathematical Programming Computation.

[3]  Hoang Duong Tuan,et al.  Generalized S-Lemma and strong duality in nonconvex quadratic programming , 2013, J. Glob. Optim..

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

[5]  Kurt M. Anstreicher,et al.  Institute for Mathematical Physics Semidefinite Programming versus the Reformulation–linearization Technique for Nonconvex Quadratically Constrained Quadratic Programming Semidefinite Programming versus the Reformulation-linearization Technique for Nonconvex Quadratically Constrained , 2022 .

[6]  Jiawang Nie,et al.  Optimality conditions and finite convergence of Lasserre’s hierarchy , 2012, Math. Program..

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

[8]  P. T. Thach,et al.  Optimization on Low Rank Nonconvex Structures , 1996 .

[9]  Duan Li,et al.  On zero duality gap in nonconvex quadratic programming problems , 2012, J. Glob. Optim..

[10]  Olvi L. Mangasarian,et al.  Nonlinear Programming , 1969 .

[11]  Masakazu Kojima,et al.  Generalized Lagrangian Duals and Sums of Squares Relaxations of Sparse Polynomial Optimization Problems , 2005, SIAM J. Optim..

[12]  Nikolaos V. Sahinidis,et al.  Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons , 2011, Math. Program..

[13]  Mirjam Dür,et al.  Lagrange Duality and Partitioning Techniques in Nonconvex Global Optimization , 1997, Universität Trier, Mathematik/Informatik, Forschungsbericht.

[14]  Abdel Lisser,et al.  Generating cutting planes for the semidefinite relaxation of quadratic programs , 2015, Comput. Oper. Res..

[15]  Samuel Burer,et al.  Separation and relaxation for cones of quadratic forms , 2013, Math. Program..

[16]  Immanuel M. Bomze,et al.  Copositive Relaxation Beats Lagrangian Dual Bounds in Quadratically and Linearly Constrained Quadratic Optimization Problems , 2015, SIAM J. Optim..

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

[18]  Hanif D. Sherali,et al.  A reformulation-convexification approach for solving nonconvex quadratic programming problems , 1995, J. Glob. Optim..

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

[20]  Sartaj Sahni,et al.  Computationally Related Problems , 1974, SIAM J. Comput..

[21]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.

[22]  Y. Ye,et al.  Semidefinite programming relaxations of nonconvex quadratic optimization , 2000 .

[23]  Fabio Tardella,et al.  New and old bounds for standard quadratic optimization: dominance, equivalence and incomparability , 2008, Math. Program..

[24]  Arkadi Nemirovski,et al.  Lectures on modern convex optimization - analysis, algorithms, and engineering applications , 2001, MPS-SIAM series on optimization.

[25]  Hiroshi Konno,et al.  Maximization of A convex quadratic function under linear constraints , 1976, Math. Program..

[26]  Wei Xia,et al.  Globally Solving Nonconvex Quadratic Programs via Linear Integer Programming Techniques , 2015, INFORMS J. Comput..

[27]  J. Lasserre.  An Introduction to Polynomial and Semi-Algebraic Optimization , 2015 .

[28]  Fabio Schoen,et al.  Global Optimization: Theory, Algorithms, and Applications , 2013 .

[29]  H. Tuy.  Convex analysis and global optimization , 1998 .

[30]  Monique Laurent,et al.  Handelman’s hierarchy for the maximum stable set problem , 2013, J. Glob. Optim..

[31]  Panos M. Pardalos,et al.  Quadratic Assignment Problem , 1997, Encyclopedia of Optimization.

[32]  Hanif D. Sherali,et al.  A global optimization algorithm for polynomial programming problems using a Reformulation-Linearization Technique , 1992, J. Glob. Optim..

[33]  D. Luenberger.  A double look at duality , 1992 .

[34]  R. Horst,et al.  Global Optimization: Deterministic Approaches , 1992 .

[35]  Zhi-Quan Luo,et al.  Semidefinite Relaxation of Quadratic Optimization Problems , 2010, IEEE Signal Processing Magazine.

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

[37]  Tamás Terlaky,et al.  A Survey of the S-Lemma , 2007, SIAM Rev..

[38]  Jean B. Lasserre,et al.  A bounded degree SOS hierarchy for polynomial optimization , 2015, EURO J. Comput. Optim..

[39]  Vaithilingam Jeyakumar,et al.  Generalized Lagrangian duality for nonconvex polynomial programs with polynomial multipliers , 2018, J. Glob. Optim..

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

[41]  James Renegar,et al.  A mathematical view of interior-point methods in convex optimization , 2001, MPS-SIAM series on optimization.

[42]  C. Floudas,et al.  Quadratic Optimization , 1995 .

[43]  Mirjam Dür,et al.  An improved algorithm to test copositivity , 2012, J. Glob. Optim..

[44]  Shuzhong Zhang,et al.  On Cones of Nonnegative Quartic Forms , 2017, Found. Comput. Math..