A dual gradient-projection method for large-scale strictly convex quadratic problems

The details of a solver for minimizing a strictly convex quadratic objective function subject to general linear constraints are presented. The method uses a gradient projection algorithm enhanced with subspace acceleration to solve the bound-constrained dual optimization problem. Such gradient proje...

Full description

Saved in:
Bibliographic Details
Published in:Computational optimization and applications Vol. 67; no. 1; pp. 1 - 38
Main Authors: Gould, Nicholas I. M., Robinson, Daniel P.
Format: Journal Article
Language:English
Published: New York Springer US 01.05.2017
Springer Nature B.V
Subjects:
Acceleration
Algorithms
Computation
Computer science
Convex and Discrete Geometry
Lagrange multiplier
Linear algebra
Management Science
Mathematical analysis
Mathematical models
Mathematics
Mathematics and Statistics
Methods
Operations Research
Operations Research/Decision Theory
Optimization
Projection
Quadratic programming
Software packages
Statistics
Studies
Gradient projection
Large-scale optimization
Sparse factorizations
Quadratic programming
Convex optimization
Dual method
ISSN:0926-6003, 1573-2894
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The details of a solver for minimizing a strictly convex quadratic objective function subject to general linear constraints are presented. The method uses a gradient projection algorithm enhanced with subspace acceleration to solve the bound-constrained dual optimization problem. Such gradient projection methods are well-known, but are typically employed to solve the primal problem when only simple bound-constraints are present. The main contributions of this work are threefold. First, we address the challenges associated with solving the dual problem, which is usually a convex problem even when the primal problem is strictly convex. In particular, for the dual problem, one must efficiently compute directions of infinite descent when they exist, which is precisely when the primal formulation is infeasible. Second, we show how the linear algebra may be arranged to take computational advantage of sparsity that is often present in the second-derivative matrix, mostly by showing how sparse updates may be performed for algorithmic quantities. We consider the case that the second-derivative matrix is explicitly available and sparse, and the case when it is available implicitly via a limited memory BFGS representation. Third, we present the details of our Fortran 2003 software package DQP, which is part of the GALAHAD suite of optimization routines. Numerical tests are performed on quadratic programming problems from the combined CUTEst and Maros and Meszaros test sets.
Bibliography:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-1
ObjectType-Feature-2
content type line 23
ISSN:0926-6003
1573-2894
DOI:10.1007/s10589-016-9886-1