Local Convergence Properties of two Augmented Lagrangian Algorithms for Optimization with a Combinat

We consider the local convergence properties of the class of augmented Lagrangian methods for solving nonlinear programming problems whose global convergence properties are analyzed by Conn et al. (1993a). In these methods, linear constraints are treated separately from more general constraints. These latter constraints are combined with the objective function in an augmented Lagrangian while the subproblem then consists of (approximately) minimizing this augmented Lagrangian subject to the linear constraints. The stopping rule that we consider for the inner iteration covers practical tests used in several existing packages for linearly constrained optimization. Our algorithmic class allows several distinct penalty parameters to be associated with di erent subsets of general equality constraints. In this paper, we analyze the local convergence of the sequence of iterates generated by this technique and prove fast linear convergence and boundedness of the potentially troublesome penalty parameters. 1 IBM T.J. Watson Research Center, P.O.Box 218, Yorktown Heights, NY 10598, USA Email : arconn@watson.ibm.com 2 CERFACS, 42 Avenue Gustave Coriolis, 31057 Toulouse Cedex, France, EC Email : gould@cerfacs.fr or nimg@letterbox.rl.ac.uk Current reports available by anonymous ftp from the directory \pub/reports" on camelot.cc.rl.ac.uk (internet 130.246.8.61) 3 Department of Mathematics, Facult es Universitaires ND de la Paix, 61, rue de Bruxelles, B-5000 Namur, Belgium, EC Email : as@math.fundp.ac.be or pht@math.fundp.ac.be Current reports available by anonymous ftp from the directory \reports" on thales.math.fundp.ac.be (internet 138.48.4.14)

[1]  M. Powell.  A method for nonlinear constraints in minimization problems , 1969 .

[2]  M. Hestenes.  Multiplier and gradient methods , 1969 .

[3]  Ekkehard W. Sachs,et al.  Algorithmic methods in optimal control , 1981 .

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

[5]  J. Dunn.  On the convergence of projected gradient processes to singular critical points , 1987 .

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

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

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

[9]  I. Lustig,et al.  Computational experience with a primal-dual interior point method for linear programming , 1991 .

[10]  Daniel Tuyttens,et al.  LSNNO, a FORTRAN subroutine for solving large-scale nonlinear network optimization problems , 1992, TOMS.

[11]  P. Toint,et al.  Lancelot: A FORTRAN Package for Large-Scale Nonlinear Optimization (Release A) , 1992 .

[12]  Nicholas I. M. Gould,et al.  Global Convergence of a Class of Trust Region Algorithms for Optimization Using Inexact Projections on Convex Constraints , 1993, SIAM J. Optim..

[13]  Nicholas I. M. Gould,et al.  Global Convergence of two Augmented Lagrangian Algorithms for Optimization with a Combination of Gen , 1993 .

[14]  W. Murray,et al.  Newton methods for large-scale linear equality-constrained minimization , 1993 .

[15]  T. Chan,et al.  Computing a search direction for large scale linearly constrained nonlinear optimization calculations , 1993 .