A Globally Convergent Augmented Lagrangian Algorithm for Optimization with General Constraints and Simple Bounds

The global and local convergence properties of a class of augmented Lagrangian methods for solving nonlinear programming problems are considered. In such methods, simple bound constraints are treated separately from more general constraints and the stopping rules for the inner minimization algorithm have this in mind. Global convergence is proved, and it is established that a potentially troublesome penalty parameter is bounded away from zero. Key words, constrained optimization, augmented Lagrangian, simple bounds, general constraints AMS(MOS) subject classifications. 65K05, 90C30