Fast algorithm for singly linearly constrained quadratic programs with box-like constraints

This paper focuses on a singly linearly constrained class of convex quadratic programs with box-like constraints. We propose a new fast algorithm based on parametric approach and secant approximation method to solve this class of quadratic problems. We design efficient implementations for our proposed algorithm and compare its performance with two state-of-the-art standard solvers called Gurobi and Mosek. Numerical results on a variety of test problems demonstrate that our algorithm is able to efficiently solve the large-scale problems with the dimension up to fifty million and it substantially outperforms Gurobi and Mosek in terms of the running time.

[1]  Roberto Cominetti,et al.  A Newton’s method for the continuous quadratic knapsack problem , 2014, Math. Program. Comput..

[2]  Kim-Chuan Toh,et al.  An introduction to a class of matrix cone programming , 2012, Mathematical Programming.

[3]  Stephen P. Boyd,et al.  Fastest Mixing Markov Chain on a Graph , 2004, SIAM Rev..

[4]  Dorit S. Hochbaum,et al.  About strongly polynomial time algorithms for quadratic optimization over submodular constraints , 1995, Math. Program..

[5]  A. G. Robinson,et al.  On the continuous quadratic knapsack problem , 1992, Math. Program..

[6]  P. Brucker.  Review of recent development: An O( n) algorithm for quadratic knapsack problems , 1984 .

[7]  N. Maculan,et al.  An O(n) Algorithm for Projecting a Vector on the Intersection of a Hyperplane and a Box in Rn , 2003 .

[8]  Stephen P. Boyd,et al.  Fastest Mixing Markov Chain on Graphs with Symmetries , 2007, SIAM J. Optim..

[9]  E. H. Zarantonello.  Projections on Convex Sets in Hilbert Space and Spectral Theory: Part I. Projections on Convex Sets: Part II. Spectral Theory , 1971 .

[10]  Roger Fletcher,et al.  New algorithms for singly linearly constrained quadratic programs subject to lower and upper bounds , 2006, Math. Program..

[11]  Yong-Jin Liu,et al.  Finding the projection onto the intersection of a closed half-space and a variable box , 2013, Oper. Res. Lett..

[12]  Dorit S. Hochbaum,et al.  Strongly Polynomial Algorithms for the Quadratic Transportation Problem with a Fixed Number of Sources , 1994, Math. Oper. Res..

[13]  Kim-Chuan Toh,et al.  On the Moreau-Yosida Regularization of the Vector k-Norm Related Functions , 2014, SIAM J. Optim..

[14]  K. Kiwiel.  Variable Fixing Algorithms for the Continuous Quadratic Knapsack Problem , 2008 .

[15]  Timothy A. Davis,et al.  An Efficient Hybrid Algorithm for the Separable Convex Quadratic Knapsack Problem , 2016, ACM Trans. Math. Softw..

[16]  Jeffery L. Kennington,et al.  A polynomially bounded algorithm for a singly constrained quadratic program , 1980, Math. Program..

[17]  Krzysztof C. Kiwiel,et al.  Breakpoint searching algorithms for the continuous quadratic knapsack problem , 2007, Math. Program..

[18]  Panos M. Pardalos,et al.  An algorithm for a singly constrained class of quadratic programs subject to upper and lower bounds , 1990, Math. Program..

[19]  Arnoldo C. Hax,et al.  Disaggregation and Resource Allocation Using Convex Knapsack Problems with Bounded Variables , 1981 .

[20]  Timothy A. Davis,et al.  Algorithm 836: COLAMD, a column approximate minimum degree ordering algorithm , 2004, TOMS.

[21]  K. Kiwiel.  On Linear-Time Algorithms for the Continuous Quadratic Knapsack Problem , 2007 .

[22]  J. J. Moré,et al.  Quasi-Newton updates with bounds , 1987 .