Please use this identifier to cite or link to this item:
Type: Artigo de periódico
Author: Andreani, R
Birgin, EG
Martinez, JM
Schuverdt, ML
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 in which the constraints are only of the lower-level type. 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 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 3 x 10(6) variables and 14 x 10(6) constraints are solved in this way, using moderate computer time. All the codes are available at to egbirgin/tango/.
Subject: nonlinear programming
augmented Lagrangian methods
global convergence
constraint qualifications
numerical experiments
Country: EUA
Editor: Siam Publications
Rights: aberto
Identifier DOI: 10.1137/060654797
Date Issue: 2007
Appears in Collections:Unicamp - Artigos e Outros Documentos

Files in This Item:
File Description SizeFormat 
WOS000207940400008.pdf538.58 kBAdobe PDFView/Open

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.