A Second Derivative SQP Method: Global Convergence
Authors:
- Nicholas I. M. GouldNGNicholas I. M. Gould
- Daniel P. RobinsonDRDaniel P. Robinson
- 1 January 2010
- journal article
- research article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Optimization
- Vol. 20 (4) , 2023-2048
Abstract
Sequential quadratic programming (SQP) methods form a class of highly efficient algorithms for solving nonlinearly constrained optimization problems. Although second derivative information may often be calculated, there is little practical theory that justifies exact-Hessian SQP methods. In particular, the resulting quadratic programming (QP) subproblems are often nonconvex, and thus finding their global solutions may be computationally nonviable. This paper presents a second derivative SQP method based on quadratic subproblems that are either convex, and thus may be solved efficiently, or need not be solved globally. Additionally, an explicit descent-constraint is imposed on certain QP subproblems, which “guides” the iterates through areas in which nonconvexity is a concern. Global convergence of the resulting algorithm is established.Keywords
This publication has 22 references indexed in Scilit:
- A Second Derivative SQP Method: Local Convergence and Practical IssuesSIAM Journal on Optimization, 2010
- Steering exact penalty methods for nonlinear programmingOptimization Methods and Software, 2008
- Flexible penalty functions for nonlinear constrained optimizationIMA Journal of Numerical Analysis, 2008
- GALAHAD, a library of thread-safe Fortran 90 packages for large-scale nonlinear optimizationACM Transactions on Mathematical Software, 2003
- On the global convergence of an SLP-filter algorithm that takes EQP stepsMathematical Programming, 2003
- Nonlinear programming without a penalty functionMathematical Programming, 2002
- LOQO:an interior point code for quadratic programmingOptimization Methods and Software, 1999
- A Trust Region Algorithm for Equality Constrained Minimization: Convergence Properties and ImplementationSIAM Journal on Numerical Analysis, 1985
- A Penalty Function Method Converging Directly to a Constrained OptimumSIAM Journal on Numerical Analysis, 1977
- An Exact Potential Method for Constrained MaximaSIAM Journal on Numerical Analysis, 1969