SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization

@article{Gill2002SNOPTAS,
  title={SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization},
  author={Philip E. Gill and Walter Murray and Michael A. Saunders},
  journal={SIAM J. Optim.},
  year={2002},
  volume={12},
  pages={979-1006}
}
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. We discuss an SQP algorithm that uses a smooth augmented Lagrangian merit function and makes explicit provision for infeasibility… 

Tables from this paper

On the Performance of SQP Methods for Nonlinear Optimization
TLDR
The results indicate that SQP methods based on maintaining a quasi-Newton approximation to the Hessian of the Lagrangian function are both reliable and efficient for general large-scale optimization problems.
Implementation of a robust SQP algorithm
  • B. Fabien
  • Computer Science
    Optim. Methods Softw.
  • 2008
TLDR
The robustness of the SQP algorithm is demonstrated via a C language implementation that is applied to numerous parameter optimization and optimal control problems that have appeared in the literature and can significantly reduce the amount of work required to solve parameter optimization problems.
IPSOL: An interior point solver for nonconvex optimization problems
TLDR
This thesis presents IPSOL, a prototype solver for general nonlinear optimization problem that uses second-derivative information and a barrier formulation to handle inequality constraints and discusses its performance on the CUTEr test set and compares the results against the current generation barrier solvers LOQO and IPOPT.
A Large-Scale Quadratic Programming Solver Based on Block-Lu Updates of the KKT System
TLDR
QPBLU is an active- set method that uses block-LU updates of an initial KKT system to handle active-set changes as well as low-rank Hessian updates that is intended for convex QP problems in which the linear constraint matrix is sparse and many degrees of freedom are expected at the solution.
User’s Guide For Snopt Version 6, A Fortran Package for Large-Scale Nonlinear Programming∗
TLDR
SNOPT is a general-purpose system for solving optimization problems involving many variables and constraints, suitable for large-scale linear and quadratic programming and for linearly constrained optimization, as well as for general nonlinear programs.
A barrier algorithm for large nonlinear optimization problems
The problem of large-scale constrained optimization is addressed. A barrier function is used to transform the problem into a sequence of subproblems with nonlinear equality constraints. The method
A Globally Convergent Linearly Constrained Lagrangian Method for Nonlinear Optimization
TLDR
This work derives a related LCL algorithm that possesses three important properties: it is globally convergent, the subproblem constraints are always feasible, and the subproblems may be solved inexactly.
Nonlinearly constrained optimization via sequential regularized linear programming
TLDR
A new active-set method for large-scale nonlinearly constrained optimization based on using a 2-norm regularization term in the objective and showing that the trust-region constraints in the trustregion subproblems significantly reduce the warm-start efficiency of these subproblem solves, and also unnecessarily induce infeasible subpro problems is proposed.
A Truncated SQP Method Based on Inexact Interior-Point Solutions of Subproblems
TLDR
A truncated SQP algorithm in which subproblems are solved approximately by an infeasible predictor-corrector interior-point method, followed by setting to zero some variables and some multipliers so that complementarity conditions for approximate solutions are enforced.
User's Guide for SNOPT Version 7.4: Software for Large-Scale Nonlinear Programming
TLDR
SNOPT minimizes a linear or nonlinear function subject to bounds on the variables and sparse linear orNonlinear constraints and is suitable for large-scale linear and quadratic programming and for linearly constrained optimization, as well as for general nonlinear programs.
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 154 REFERENCES
Large-scale sequential quadratic programming algorithms
TLDR
The goal is to devise an SQP algorithm that is applicable to large-scale optimization problems, using sparse data structures and storing less curvature information but maintaining the property of superlinear convergence.
A New SQP Algorithm for Large-Scale Nonlinear Programming
TLDR
An efficient new SQP algorithm capable of solving large-scale problems is described and it is shown that if any iterate is close enough to an isolated connected subset of local minimizers, then the iterates converge to this subset.
A Sequential Quadratic Programming Algorithm Using an Incomplete Solution of the Subproblem
TLDR
This work analyzes sequential quadratic programming methods to solve nonlinear constrained optimization problems that are more flexible in their definition than standard SQP methods and focuses on an SQP algorithm that uses a particular augmented Lagrangian merit function.
An SQP method for general nonlinear programs using only equality constrained subproblems
TLDR
A new version of a sequential equality constrained quadratic programming method for general nonlinear programs with mixed equality and inequality constraints is described, which is much simpler to implement and allows any kind of changes of the working set in every step.
USER’S GUIDE FOR SNOPT 5.3: A FORTRAN PACKAGE FOR LARGE-SCALE NONLINEAR PROGRAMMING
TLDR
SNOPT is a set of Fortran subroutines for minimizing a smooth function subject to constraints, which may include simple bounds on the variables, linear constraints and smooth nonlinear constraints, designed to find locally optimal solutions for models involving smooth non linear functions.
Some theoretical properties of an augmented lagrangian merit function
Sequential quadratic programming (SQP) methods for nonlinearly constrained optimization typically use of a merit function to enforce convergence from an arbitrary starting point. We define a smooth
A Global Convergence Analysis of an Algorithm for Large-Scale Nonlinear Optimization Problems
TLDR
A global convergence analysis of a basic version of an SQP algorithm described in [P. T. Tolle, SIAM J. Optim., 9 (1999), pp. 755--778] for the solution of large-scale nonlinear inequality-constrained optimization problems.
Han's method without solving QP
TLDR
The present paper gives a complete description of a correponding algorithm along with proofs of convergence and rate of convergence results.
An analysis of reduced Hessian methods for constrained optimization
TLDR
This work uses a backtracking line search, and updates an approximation to the reduced Hessian of the Lagrangian by means of the BFGS formula, and gives conditions under which local and superlinear convergence is obtained, and proves a global convergence result.
Benchmarking optimization software with COPS.
TLDR
This report describes version 2.0 of the COPS problems, and includes the results of computational experiments with the LANCELOT, LOQO, MINOS, and SNOPT solvers.
...
1
2
3
4
5
...