A Feasible Trust-Region Sequential Quadratic Programming Algorithm

An algorithm for smooth nonlinear constrained optimization problems is described, in which a sequence of feasible iterates is generated by solving a trust-region sequential quadratic programming (SQP) subproblem at each iteration, and perturbing the resulting step to retain feasibility of each iterate. By retaining feasibility, the algorithm avoids several complications of other trust-region SQP approaches: The objective function can be used as a merit function and the SQP subproblems are feasible for all choices of the trust-region radius. Global convergence properties are analyzed under different assumptions on the approximate Hessian. Under additional assumptions, superlinear convergence to points satisfying second-order sufficient conditions is proved.


Optimization Technical Report 02-05, August, 2002, Computer Sciences Department, University of Wisconsin. Texas-Wisconsin Modeling and Control Consortium Report TWMCC-2002-01. Revised May, 2003 and September, 2003.



View A Feasible Trust-Region Sequential Quadratic Programming Algorithm