Journal
SIAM JOURNAL ON OPTIMIZATION
Volume 18, Issue 4, Pages 1286-1309Publisher
SIAM PUBLICATIONS
DOI: 10.1137/060654797
Keywords
nonlinear programming; augmented Lagrangian methods; global convergence; constraint qualifications; numerical experiments
Categories
Funding
- PRONEX-Optimization [PRONEX - CNPq / FAPERJ E-26 / 171.164/2003 - APQ1]
- FAPESP [2001/04597-4, 2002/00832-1, 2003/09169-6]
- CNPq
- Fundacao de Amparo a Pesquisa do Estado de Sao Paulo (FAPESP) [01/04597-4] Funding Source: FAPESP
Ask authors/readers for more resources
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/.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available