QPALM: A Proximal Augmented Lagrangian Method for Nonconvex Quadratic Programs

Abstract

We propose QPALM, a nonconvex quadratic programming (QP) solver based on the proximal augmented Lagrangian method. This method solves a sequence of inner subproblems which can be enforced to be strongly convex and which therefore admit a unique solution. The resulting steps are shown to be equivalent to inexact proximal point iterations on the extended-real-valued cost function, which allows for a fairly simple analysis where convergence to a stationary point at an \(R\)-linear rate is shown. The QPALM algorithm solves the subproblems iteratively using semismooth Newton directions and an exact linesearch. The former can be computed efficiently in most iterations by making use of suitable factorization update routines, while the latter requires the zero of a monotone, one-dimensional, piecewise affine function. QPALM is implemented in open-source C code, with tailored linear algebra routines for the factorization in a self-written package LADEL. The resulting implementation is shown to be extremely robust in numerical simulations, solving all of the Maros-Meszaros problems and finding a stationary point for most of the nonconvex QPs in the Cutest test set. Furthermore, it is shown to be competitive against state-of-the-art convex QP solvers in typical QPs arising from application domains such as portfolio optimization and model predictive control. As such, QPALM strikes a unique balance between solving both easy and hard problems efficiently.

References in corpus (8)

• OSQP: An Operator Splitting Solver for Quadratic Programs
• Global convergence of splitting methods for nonconvex composite optimization
• Douglas-Rachford splitting and ADMM for nonconvex optimization: tight convergence results
• QPALM: A Proximal Augmented Lagrangian Method for Nonconvex Quadratic Programs
• On the acceleration of forward-backward splitting via an inexact Newton method
• QPALM: A Newton-type Proximal Augmented Lagrangian Method for Quadratic Programs
• Inexact Proximal-Point Penalty Methods for Constrained Non-Convex Optimization
• A convergence framework for inexact nonconvex and nonsmooth algorithms and its applications to several iterations

Cited by in corpus (3)

• QPALM: A Proximal Augmented Lagrangian Method for Nonconvex Quadratic Programs
• Implicit augmented Lagrangian and generalized optimization
• QPPAL: A two-phase proximal augmented Lagrangian method for high dimensional convex quadratic programming problems