Augmented Lagrangian Method
Overview
Augmented Lagrangian methods turn constrained optimization into a sequence of penalized problems, updating multipliers to drive solutions toward feasibility without relying on ever-larger penalties alone. Current approaches include classical multiplier updates, linearized and smoothed primal-dual methods, and inexact or matrix-free subproblem solvers, with guarantees for convex, nonconvex, stochastic, and nonsmooth settings. They are used in applications ranging from safe reinforcement learning and causal discovery to differentiable optimization and contact-rich robot planning. A central tension is balancing reliable feasibility and convergence guarantees against ill-conditioning, expensive subproblem solves, noisy constraint estimates, and constraints that may be infeasible.
Latest papers
19 papers2 papers in the last four weeks, down 50% on the four weeks before. 0.0% of all new papers.