A Robust Trust Region Method for Constrained Nonlinear Programming Problems

Most of the published work on trust region algorithms for constrained optimization is derived from the original work of Fletcher on trust region algorithms for nondifferentiable exact penalty functions. These methods are restricted to applications where a reasonable estimate of the magnitude of an optimal Kuhn–Tucker multiplier vector can be given. More recently an effort has been made to extend the trust region methodology to the sequential quadratic programming (SQP) algorithm of Wilson, Han, and Powell. All of these extensions to the Wilson–Han–Powell SQP algorithm consider only the equality-constrained case and require strong global regularity hypotheses. This paper presents a general framework for trust region algorithms for constrained problems that does not require such regularity hypotheses and allows very general constraints. The approach is modeled on the one given by Powell for convex composite optimization problems and is driven by linear subproblems that yield viable estimates for the value o...

[1]  Stephen M. Robinson,et al.  Lower Semicontinuity of Multivalued Linearization Mappings , 1973 .

[2]  Ya-Xiang Yuan,et al.  Conditions for convergence of trust region algorithms for nonsmooth optimization , 1985, Math. Program..

[3]  S. M. Robinson.  Stability Theory for Systems of Inequalities. Part I: Linear Systems , 1975 .

[4]  J. Burke.  On identification of active constraints II: the nonconvex case , 1990 .

[5]  M. El-Alem.  A global convergence theory for the Celis-Dennis-Tapia trust-region algorithm for constrained optimization , 1991 .

[6]  Ya-Xiang Yuan,et al.  A trust region algorithm for equality constrained optimization , 1990, Math. Program..

[7]  James V. Burke,et al.  A robust sequential quadratic programming method , 1989, Math. Program..

[8]  Jorge J. Moré,et al.  Trust regions and projected gradients , 1988 .

[9]  M. J. D. Powell,et al.  A fast algorithm for nonlinearly constrained optimization calculations , 1978 .

[10]  Stephen M. Robinson,et al.  Perturbed Kuhn-Tucker points and rates of convergence for a class of nonlinear-programming algorithms , 1974, Math. Program..

[11]  Richard H. Byrd,et al.  A Trust Region Algorithm for Nonlinearly Constrained Optimization , 1987 .

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

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

[14]  Shih-Ping Han.  A globally convergent method for nonlinear programming , 1975 .

[15]  J. Burke.  A sequential quadratic programming method for potentially infeasible mathematical programs , 1989 .

[16]  R. Rockafellar,et al.  Lipschitzian properties of multifunctions , 1985 .

[17]  O. Mangasarian,et al.  The Fritz John Necessary Optimality Conditions in the Presence of Equality and Inequality Constraints , 1967 .

[18]  A. Vardi.  A Trust Region Algorithm for Equality Constrained Minimization: Convergence Properties and Implementation , 1985 .

[19]  Gerardo Toraldo,et al.  Convergence properties of trust region methods for linear and convex constraints , 1990, Math. Program..

[20]  P. Toint,et al.  Global convergence of a class of trust region algorithms for optimization with simple bounds , 1988 .

[21]  M. Sahba.  Globally convergent algorithm for nonlinearly constrained optimization problems , 1987 .

[22]  P. Toint.  Global Convergence of a a of Trust-Region Methods for Nonconvex Minimization in Hilbert Space , 1988 .