On superlinear multiplier update methods for partial augmented Lagrangian techniques.

Mijangos, Eugenio. "On superlinear multiplier update methods for partial augmented Lagrangian techniques.." Qüestiió 26.1-2 (2002): 141-171. <http://eudml.org/doc/40376>.

@article{Mijangos2002,
abstract = {The minimization of a nonlinear function with linear and nonlinear constraints and simple bounds can be performed by minimizing an augmented Lagrangian function, including only the nonlinear constraints. This procedure is particularly interesting in case that the linear constraints are flow conservation equations, as there exist efficient techniques to solve nonlinear network problems. It is then necessary to estimate their multipliers, and variable reduction techniques can be used to carry out the successive minimizations. This work analyzes the possibility of estimating these multipliers using Newton-like methods. Several procedures are put forward which combine first and second-order estimation, and are compared with each other and with the Hestenes-Powell multiplier estimation by means of computational tests.},
author = {Mijangos, Eugenio},
journal = {Qüestiió},
keywords = {Programación matemática; Minimización; Multiplicadores de Lagrange; Redes no lineales},
language = {eng},
number = {1-2},
pages = {141-171},
title = {On superlinear multiplier update methods for partial augmented Lagrangian techniques.},
url = {http://eudml.org/doc/40376},
volume = {26},
year = {2002},
}

TY - JOUR
AU - Mijangos, Eugenio
TI - On superlinear multiplier update methods for partial augmented Lagrangian techniques.
JO - Qüestiió
PY - 2002
VL - 26
IS - 1-2
SP - 141
EP - 171
AB - The minimization of a nonlinear function with linear and nonlinear constraints and simple bounds can be performed by minimizing an augmented Lagrangian function, including only the nonlinear constraints. This procedure is particularly interesting in case that the linear constraints are flow conservation equations, as there exist efficient techniques to solve nonlinear network problems. It is then necessary to estimate their multipliers, and variable reduction techniques can be used to carry out the successive minimizations. This work analyzes the possibility of estimating these multipliers using Newton-like methods. Several procedures are put forward which combine first and second-order estimation, and are compared with each other and with the Hestenes-Powell multiplier estimation by means of computational tests.
LA - eng
KW - Programación matemática; Minimización; Multiplicadores de Lagrange; Redes no lineales
UR - http://eudml.org/doc/40376
ER -