On the Convergence of Successive Linear-Quadratic Programming Algorithms
Richard H. Byrd (richardcs.colorado.edu)
Abstract: The global convergence properties of a class of penalty methods for nonlinear programming are analyzed. These methods include successive linear programming approaches, and more specifically, the successive linear-quadratic programming approach presented by Byrd, Gould, Nocedal and Waltz (Math. Programming 100(1):27--48, 2004). Every iteration requires the solution of two trust-region subproblems involving piecewise linear and quadratic models, respectively. It is shown that, for a fixed penalty parameter, the sequence of iterates approaches stationarity of the penalty function. A procedure for dynamically adjusting the penalty parameter is described, and global convergence results for it are established.
Keywords: nonlinear programming, SLQP, penalty methods
Category 1: Nonlinear Optimization
Category 2: Nonlinear Optimization (Constrained Nonlinear Optimization )
Category 3: Convex and Nonsmooth Optimization (Nonsmooth Optimization )
Citation: Technical Report OTC 2002/5, Optimization Technology Center, Northwestern University, Evanston, IL, USA 2002 (revised Oct. 2004).
Entry Submitted: 10/19/2004
Modify/Update this entry
|Visitors||Authors||More about us||Links|
Search, Browse the Repository
Give us feedback
|Optimization Journals, Sites, Societies|