Machine learningOptimization

Augmented Lagrangian Method

The Augmented Lagrangian Method, developed by Magnus R. Hestenes and M. J. D. Powell in 1969, is a powerful technique for solving constrained optimization problems. It converts a constrained problem into a sequence of unconstrained subproblems by augmenting the Lagrangian with a quadratic penalty term, enabling efficient solution of large-scale problems including convex and nonconvex cases.

Open in MethodMindSoonVideoSoon

Read the full method

Members only

Sign in with a free account to read this section.

Sign in

Sources

  1. Hestenes, M. R. (1969). Multiplier and gradient methods. Journal of Optimization Theory and Applications, 4(5), 303-320. DOI: 10.1007/BF00927673
  2. Powell, M. J. D. (1969). A method for nonlinear constraints in minimization problems. In Optimization (pp. 283-298). Academic Press. link
  3. Boyd, S., Parikh, N., Chu, E., Peleato, B., & Eckstein, J. (2011). Distributed optimization and statistical learning via the alternating direction method of multipliers. Foundations and Trends in Machine Learning, 3(1), 1-122. DOI: 10.1561/2200000016

Related methods

Referenced by

ScholarGateAugmented Lagrangian Method (Augmented Lagrangian Method for Constrained Optimization). Retrieved 2026-06-04 from https://scholargate.app/en/operations-research/augmented-lagrangian-method