A Newton’s method for the continuous quadratic knapsack problem

We introduce a new efficient method to solve the continuous quadratic knapsack problem. This is a highly structured quadratic program that appears in different contexts. The method converges after $$O(n)$$O(n) iterations with overall arithmetic complexity $$O(n^2)$$O(n2). Numerical experiments show that in practice the method converges in a small number of iterations with overall linear complexity, and is faster than the state-of-the-art algorithms based on median finding, variable fixing, and secant techniques.

[1]  C. Michelot.  A finite algorithm for finding the projection of a point onto the canonical simplex of ∝n , 1986 .

[2]  A. Fiacco.  A Finite Algorithm for Finding the Projection of a Point onto the Canonical Simplex of R " , 2009 .

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

[4]  Stavros A. Zenios,et al.  Massively Parallel Algorithms for Singly Constrained Convex Programs , 1992, INFORMS J. Comput..

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

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

[7]  José Mario Martínez,et al.  Algorithm 813: SPG—Software for Convex-Constrained Optimization , 2001, TOMS.

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

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

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

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

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

[13]  Michael C. Ferris,et al.  Semismooth support vector machines , 2004, Math. Program..

[14]  Makoto Matsumoto,et al.  SIMD-Oriented Fast Mersenne Twister: a 128-bit Pseudorandom Number Generator , 2008 .

[15]  Takuji Nishimura,et al.  Mersenne twister: a 623-dimensionally equidistributed uniform pseudo-random number generator , 1998, TOMC.

[16]  Harald Niederreiter,et al.  Monte Carlo and Quasi-Monte Carlo Methods 2006 , 2007 .

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

[18]  Bala Shetty,et al.  A Parallel Projection for the Multicommodity Network Model , 1990 .

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

[20]  R. Caflisch.  Monte Carlo and quasi-Monte Carlo methods , 1998, Acta Numerica.

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

[22]  Krzysztof C. Kiwiel,et al.  On Floyd and Rivest's SELECT algorithm , 2005, Theor. Comput. Sci..

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

[24]  Philip Wolfe,et al.  Validation of subgradient optimization , 1974, Math. Program..

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

[26]  Jose A. Ventura,et al.  Computational development of a lagrangian dual approach for quadratic networks , 1991, Networks.

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

[28]  José Mario Martínez,et al.  Nonmonotone Spectral Projected Gradient Methods on Convex Sets , 1999, SIAM J. Optim..

[29]  James T. Hungerford,et al.  THE SEPARABLE CONVEX QUADRATIC KNAPSACK PROBLEM , 2013 .

[30]  Bala Shetty,et al.  Quadratic resource allocation with generalized upper bounds , 1997, Oper. Res. Lett..

[31]  Siddhartha S. Syam,et al.  A Branch and Bound Algorithm for Integer Quadratic Knapsack Problems , 1995, INFORMS J. Comput..

[32]  William W. Hager,et al.  An Affine-Scaling Interior-Point Method for Continuous Knapsack Constraints with Application to Support Vector Machines , 2011, SIAM J. Optim..