An Inexact SQP Method for Equality Constrained Optimization
- 1 January 2008
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Optimization
- Vol. 19 (1), 351-369
- https://doi.org/10.1137/060674004
Abstract
We present an algorithm for large-scale equality constrained optimization. The method is based on a characterization of inexact sequential quadratic programming (SQP) steps that can ensure global convergence. Inexact SQP methods are needed for large-scale applications for which the iteration matrix cannot be explicitly formed or factored and the arising linear systems must be solved using iterative linear algebra techniques. We address how to determine when a given inexact step makes sufficient progress toward a solution of the nonlinear program, as measured by an exact penalty function. The method is globalized by a line search. An analysis of the global convergence properties of the algorithm and numerical results are presented.Keywords
This publication has 17 references indexed in Scilit:
- Parallel Lagrange--Newton--Krylov--Schur Methods for PDE-Constrained Optimization. Part II: The Lagrange--Newton Solver and Its Application to Optimal Control of Steady Viscous FlowsSIAM Journal on Scientific Computing, 2005
- Parallel Lagrange--Newton--Krylov--Schur Methods for PDE-Constrained Optimization. Part I: The Krylov--Schur SolverSIAM Journal on Scientific Computing, 2005
- CUTEr and SifDecACM Transactions on Mathematical Software, 2003
- Preconditioned all-at-once methods for large, sparse parameter estimation problemsInverse Problems, 2001
- A trust region method based on interior point techniques for nonlinear programmingMathematical Programming, 2000
- An Interior Point Algorithm for Large-Scale Nonlinear ProgrammingSIAM Journal on Optimization, 1999
- CUTEACM Transactions on Mathematical Software, 1995
- An analysis of reduced Hessian methods for constrained optimizationMathematical Programming, 1990
- Inexact Newton MethodsSIAM Journal on Numerical Analysis, 1982
- A globally convergent method for nonlinear programmingJournal of Optimization Theory and Applications, 1977