Please use this identifier to cite or link to this item: http://repositorio.unicamp.br/jspui/handle/REPOSIP/67595
Type: Artigo
Title: On augmented Lagrangian methods with general lower-level constraints
Author: Andreani, R.
Birgin, E. G.
Martinez, J. M.
Schuverdt, M. L.
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 http://www.ime.usp.br/similar to egbirgin/tango/.
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 r
Subject: Programação não-linear
Lagrangiano aumentado
Convergência global
Condições de qualificação
Experimentos numéricos
Country: Estados Unidos
Editor: Society for Industrial and Applied Mathematics
Citation: Siam Journal On Optimization. Siam Publications, v. 18, n. 4, n. 1286, n. 1309, 2007.
Rights: aberto
Identifier DOI: 10.1137/060654797
Address: https://epubs.siam.org/doi/10.1137/060654797
Date Issue: 2007
Appears in Collections:IMECC - Artigos e Outros Documentos

Files in This Item:
File Description SizeFormat 
000207940400008.pdf359.87 kBAdobe PDFView/Open


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