Metraipolis › archive › dc_85367e3c8c8f
Augmented Lagrangian method — Wikipedia (en)
- Source
- Wikipedia (en)
- Original
- https://en.wikipedia.org/wiki/Augmented_Lagrangian_method
- License (as archived)
- CC-BY-SA-4.0
- Archived
- 2026-11-10T08:53:04.891Z
- SHA-256 of the archived text
de6dce5a7f7e3b6db82cf064bafdcfd54a9951d5fc02a6356666071df4089ba7- Stable URL of this page
https://metraipolis.com/documento/dc_85367e3c8c8f
How to cite
Augmented Lagrangian method — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Augmented_Lagrangian_method (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_85367e3c8c8f (Metraipolis archive dc_85367e3c8c8f, sha256 de6dce5a7f7e3b6db82cf064bafdcfd54a9951d5fc02a6356666071df4089ba7)
BibTeX
@misc{dc85367e3c8c8f,
title = {Augmented Lagrangian method — Wikipedia (en)},
howpublished = {Wikipedia (en)},
url = {https://en.wikipedia.org/wiki/Augmented_Lagrangian_method},
note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_85367e3c8c8f; sha256 de6dce5a7f7e3b6db82cf064bafdcfd54a9951d5fc02a6356666071df4089ba7},
year = {2026}
}Archived text
Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Augmented_Lagrangian_method. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Augmented Lagrangian methods are a certain class of algorithms for solving constrained optimization problems. They have similarities to penalty methods in that they replace a constrained optimization problem by a series of unconstrained problems and add a penalty term to the objective, but the augmented Lagrangian method adds yet another term designed to mimic a Lagrange multiplier. The augmented Lagrangian is related to, but not identical with, the method of Lagrange multipliers. Viewed differently, the unconstrained objective is the Lagrangian of the constrained problem, with an additional penalty term (the augmentation). The method was originally known as the method of multipliers and was studied in the 1970s and 1980s as a potential alternative to penalty methods. It was first discussed by Magnus Hestenes and then by Michael Powell in 1969. The method was studied by R. Tyrrell Rockafellar in relation to Fenchel duality, particularly in relation to proximal-point methods, Moreau–Yosida regularization, and maximal monotone operators; these methods were used in structural optimization. The method was also studied by Dimitri Bertsekas, notably in his 1982 book, together with extensions involving non-quadratic regularization functions (e.g., entropic regularization). This combined study gives rise to the "exponential method of multipliers" which handles inequality constraints with a twice-differentiable augmented Lagrangian function. Since the 1970s, sequential quadratic programming (SQP) and interior point methods (IPM) have been given more attention, in part because they more easily use sparse matrix subroutines from numerical software libraries, and in part because IPMs possess proven complexity results via the theory of self-concordant functions. The augmented Lagrangian method was rejuvenated by the optimization systems LANCELOT, ALGENCAN and AMPL, which allowed sparse matrix techniques to be used on seemingly dense but "partially-separable" problems. The method is still useful for some problems. Around 2007, there was a resurgence of augmented Lagrangian methods in fields such as total variation denoising and compressed sensing. In particular, a variant of the standard augmented Lagrangian method that uses partial updates (similar to the Gauss–Seidel method for solving linear equations) known as the alternating direction method of multipliers or ADMM gained some attention. Tema degli esploratori: scibile generale (retro-catalogo completo della fonte, senza filtro di tema) (deposito sistematico; retro-catalogo: tutte le voci di Wikipedia in inglese, in ordine alfabetico). Fonte: Wikipedia in inglese, voce «Augmented Lagrangian method» — https://en.wikipedia.org/wiki/Augmented_Lagrangian_method Wikidata Q4820432: «class of algorithms for solving constrained optimization problems» (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q4820432 Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Augmented_Lagrangian_method?action=history). Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza. Estratto dell'introduzione non modificato nel contenuto; revisione 1346520721, consultata il 2026-11-10T08:48:53.878Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: 5c65ab03f463bbb54329272006f9c4e5068515c9048f1af068aa145f0e90cc40