Optimization Online


On Augmented Lagrangian methods with general lower-level constraints

Roberto Andreani (andreani***at***ime.unicamp.br)
Ernesto Birgin (egbirgin***at***ime.usp.br)
José Mario Martínez (martinez***at***ime.unicamp.br)
María Laura Schuverdt (schuverd***at***ime.unicamp.br)

Abstract: Augmented Lagrangian methods with general lower-level constraints are considered in the present research. These methods are useful when efficient algorithms exist for solving subproblems where the constraints are only of the lower-level type. Two methods of this class are introduced and analyzed. Inexact resolution of the lower-level constrained subproblems is considered. Global convergence is proved using the Constant Positive Linear Dependence constraint qualification. Conditions for boundedness of the penalty parameters are discussed. The reliability of the approach is tested by means of an exhaustive comparison against Lancelot. All the problems of the Cute collection are used in this comparison. Moreover, the resolution of location problems in which many constraints of the lower-level set are nonlinear is addressed, employing the Spectral Projected Gradient method for solving the subproblems. Problems of this type with more than 3x10^6 variables and 14x10^6 constraints are solved in this way, using moderate computer time.

Keywords: Nonlinear programming, Augmented Lagrangian methods,global convergence, constraint qualifications, numerical experiments.

Category 1: Nonlinear Optimization

Category 2: Nonlinear Optimization (Constrained Nonlinear Optimization )


Download: [PDF]

Entry Submitted: 03/04/2005
Entry Accepted: 03/04/2005
Entry Last Modified: 05/12/2006

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Programming Society