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 by 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 various assumptions on the approximate Hessian. Under additional assumptions, superlinear convergence to points satisfying second-order sufficient conditions is proved.

[1]  A. Hoffman.  On approximate solutions of systems of linear inequalities , 1952 .

[2]  S. M. Robinson.  Stability Theory for Systems of Inequalities, Part II: Differentiable Nonlinear Systems , 1976 .

[3]  D. Bertsekas.  Projected Newton methods for optimization problems with simple constraints , 1981, 1981 20th IEEE Conference on Decision and Control including the Symposium on Adaptive Processes.

[4]  F. Clarke.  Optimization And Nonsmooth Analysis , 1983 .

[5]  Richard A. Tapia,et al.  A trust region strategy for nonlinear equality constrained op-timization , 1984 .

[6]  Ya-Xiang Yuan,et al.  On the superlinear convergence of a trust region algorithm for nonsmooth optimization , 1985, Math. Program..

[7]  Roger Fletcher,et al.  Nonlinear programming and nonsmooth optimization by successive linear programming , 1989, Math. Program..

[8]  E. Omojokun.  Trust region algorithms for optimization with nonlinear equality and inequality constraints , 1990 .

[9]  Stephen J. Wright.  Convergence of an inexact algorithm for composite nonsmooth optimization , 1990 .

[10]  André L. Tits,et al.  On combining feasibility, descent and superlinear convergence in inequality constrained optimization , 1993, Math. Program..

[11]  Matthias Heinkenschloss.  Projected Sequential Quadratic Programming Methods , 1996, SIAM J. Optim..

[12]  Francisco Facchinei,et al.  On the Accurate Identification of Active Constraints , 1998, SIAM J. Optim..

[13]  Craig T. Lawrence,et al.  A Computationally Efficient Feasible Sequential Quadratic Programming Algorithm , 2000, SIAM J. Optim..

[14]  L. Qi,et al.  A Variant of the Topkis—Veinott Method for Solving Inequality Constrained Optimization Problems , 2000 .

[15]  Nicholas I. M. Gould,et al.  Trust Region Methods , 2000, MOS-SIAM Series on Optimization.

[16]  Paul Tseng,et al.  Objective-derivative-free methods for constrained optimization , 2002, Math. Program..

[17]  Stephen J. Wright,et al.  Nonlinear Model Predictive Control via Feasibility-Perturbed Sequential Quadratic Programming , 2004, Comput. Optim. Appl..