Abstract
Sequential quadratic programming (SQP) methods have proved highly effective for solving constrained optimization problems with smooth nonlinear functions in the objective and constraints. Here we consider problems with general inequality constraints (linear and nonlinear). We assume that first derivatives are available and that the constraint gradients are sparse. Second derivatives are assumed to be unavailable or too expensive to calculate. We discuss an SQP algorithm that uses a smooth augmented Lagrangian merit function and makes explicit provision for infeasibility in the original problem and the QP subproblems. The Hessian of the Lagrangian is approximated using a limited-memory quasi-Newton method. SNOPT is a particular implementation that uses a reduced-Hessian semidefinite QP solver (SQOPT) for the QP subproblems. It is designed for problems with many thousands of constraints and variables but is best suited for problems with a moderate number of degrees of freedom (say, up to 2000). Numerical results are given for most of the CUTEr and COPS test collections (about 1020 examples of all sizes up to 40000 constraints and variables, and up to 20000 degrees of freedom).
Keywords
Hessian matrixSequential quadratic programmingAugmented Lagrangian methodSolverMathematical optimizationMathematicsConstrained optimizationNonlinear programmingTrust regionQuadratic programmingDegrees of freedom (physics and chemistry)Constraint (computer-aided design)Broyden–Fletcher–Goldfarb–Shanno algorithmNonlinear systemQuadratic equationAlgorithmComputer scienceApplied mathematics
Related Publications
Fast Training of Support Vector Machines Using Sequential Minimal Optimization
This chapter describes a new algorithm for training Support Vector Machines: Sequential Minimal Optimization, or SMO. Training a Support Vector Machine (SVM) requires the soluti...
A Global Geometric Framework for Nonlinear Dimensionality Reduction
Scientists working with large volumes of high-dimensional data, such as global climate patterns, stellar spectra, or human gene distributions, regularly confront the problem of ...
Image Superresolution Using Support Vector Regression
A thorough investigation of the application of support vector regression (SVR) to the superresolution problem is conducted through various frameworks. Prior to the study, the SV...
Reconfigurable Intelligent Surfaces for Energy Efficiency in Wireless Communication
The adoption of a Reconfigurable Intelligent Surface (RIS) for downlink multi-user communication from a multi-antenna base station is investigated in this paper. We develop ener...
<i>Planck</i>2015 results
We present results based on full-mission Planck observations of temperature and polarization anisotropies of the CMB. These data are consistent with the six-parameter inflationa...
Publication Info
- Year
- 2005
- Type
- article
- Volume
- 47
- Issue
- 1
- Pages
- 99-131
- Citations
- 2744
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
2744
OpenAlex
Cite This
Philip E. Gill,
Walter Murray,
Michael A. Saunders
(2005).
SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization.
SIAM Review
, 47
(1)
, 99-131.
https://doi.org/10.1137/s0036144504446096
Identifiers
- DOI
- 10.1137/s0036144504446096