swMATH ID: 23701
Software Authors: Davis, Timothy A.; Hager, William W.; Hungerford, James T.
Description: An efficient hybrid algorithm for the separable convex quadratic knapsack problem. This article considers the problem of minimizing a convex, separable quadratic function subject to a knapsack constraint and a box constraint. An algorithm called NAPHEAP has been developed to solve this problem. The algorithm solves the Karush-Kuhn-Tucker system using a starting guess to the optimal Lagrange multiplier and updating the guess monotonically in the direction of the solution. The starting guess is computed using the variable fixing method or is supplied by the user. A key innovation in our algorithm is the implementation of a heap data structure for storing the break points of the dual function and computing the solution of the dual problem. Also, a new version of the variable fixing algorithm is developed that is convergent even when the objective Hessian is not strictly positive definite. The hybrid algorithm NAPHEAP that uses a Newton-type method (variable fixing method, secant method, or Newton’s method) to bracket a root, followed by a heap-based monotone break point search, can be faster than a Newton-type method by itself, as demonstrated in the numerical experiments.
Homepage: https://dl.acm.org/citation.cfm?doid=2935754.2828635
Keywords: continuous quadratic knapsack; convex programming; heap; nonlinear programming; quadratic programming; separable programming
Related Software: SPG; ALGENCAN; Knapsack; CSparse; symrcm; SparseMatrix; METIS; Mosek; Gurobi; PPROJ; Algorithm 656; Algorithm 679; NETLIB LP Test Set; UNLocBoX; PDCO; Ipopt; CHOLMOD; CPLEX; BLAS; GALAHAD
Referenced in: 11 Publications

Referencing Publications by Year