Namur On the Number of Inner Iterations Per Outer Iteration of a Globally Convergent Algorithm for Optimization with General Nonlinear Inequality Constraints and Simple

This paper considers the number of inner iterations required per outer iteration for the algorithm proposed by Conn et al.1991a (). We show that asymptotically, under suitable reasonable assumptions, a single inner iteration suffices. 1 IBM T.J. Watson Research Centre Yorktown Heights, USA 2 Rutherford Appleton Laboratory Oxfordshire, England 3 Department of Mathematics, Facultés Universitaires ND de la Paix, Namur, Belgium Invited paper at the Dundee Conference on Numerical Analysis, 1991.

[1]  P. Toint,et al.  A globally convergent augmented Lagrangian algorithm for optimization with general constraints and simple bounds , 1991 .

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

[3]  N. Gould.  On the convegence of a sequential penalty function method for constrained minimization , 1989 .

[4]  J. J. Moré,et al.  On the identification of active constraints , 1988 .

[5]  P. Toint,et al.  Testing a class of methods for solving minimization problems with simple bounds on the variables , 1988 .

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

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

[8]  Paul H. Calamai,et al.  Projected gradient methods for linearly constrained problems , 1987, Math. Program..

[9]  N. Gould.  On the Accurate Determination of Search Directions for Simple Differentiable Penalty Functions , 1986 .

[10]  John E. Dennis,et al.  Numerical methods for unconstrained optimization and nonlinear equations , 1983, Prentice Hall series in computational mathematics.

[11]  Dimitri P. Bertsekas,et al.  Constrained Optimization and Lagrange Multiplier Methods , 1982 .

[12]  R. Tapia.  Diagonalized multiplier methods and quasi-Newton methods for constrained optimization , 1977 .

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

[14]  J. J. Moré,et al.  A Characterization of Superlinear Convergence and its Application to Quasi-Newton Methods , 1973 .