**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; the difference is that the augmented Lagrangian method adds yet another term, designed to mimic a Lagrange multiplier. The augmented Lagrangian is not the same as 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 much in the 1970 and 1980s as a good alternative to penalty methods. It was first discussed by Magnus Hestenes in 1969 and by 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 nonquadratic regularization functions, such as entropic regularization, which gives rise to the "exponential method of multipliers," a method that handles inequality constraints with a twice differentiable augmented Lagrangian function.

Since the 1970s, sequential quadratic programming (SQP) and interior point methods (IPM) have had increasing attention, in part because they more easily use sparse matrix subroutines from numerical software libraries, and in part because IPMs have proven complexity results via the theory of self-concordant functions. The augmented Lagrangian method was rejuvenated by the optimization systems LANCELOT 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.

Let us say we are solving the following constrained problem:

min
f
(
x
)
subject to

c
i
(
x
)
=
0
∀
i
∈
I
.
This problem can be solved as a series of unconstrained minimization problems. For reference, we first list the penalty method approach:

min
Φ
k
(
x
)
=
f
(
x
)
+
μ
k
∑
i
∈
I
c
i
(
x
)
2
The penalty method solves this problem, then at the next iteration it re-solves the problem using a larger value of
μ
k
(and using the old solution as the initial guess or "warm-start").

The augmented Lagrangian method uses the following unconstrained objective:

min
Φ
k
(
x
)
=
f
(
x
)
+
μ
k
2
∑
i
∈
I
c
i
(
x
)
2
−
∑
i
∈
I
λ
i
c
i
(
x
)
and after each iteration, in addition to updating
μ
k
, the variable
λ
is also updated according to the rule

λ
i
←
λ
i
−
μ
k
c
i
(
x
k
)
where
x
k
is the solution to the unconstrained problem at the *k*th step, i.e.
x
k
=
argmin
Φ
k
(
x
)

The variable
λ
is an estimate of the Lagrange multiplier, and the accuracy of this estimate improves at every step. The major advantage of the method is that unlike the penalty method, it is not necessary to take
μ
→
∞
in order to solve the original constrained problem. Instead, because of the presence of the Lagrange multiplier term,
μ
can stay much smaller.

The method can be extended to handle inequality constraints. For a discussion of practical improvements, see.

In it is suggested that the augmented Lagrangian method is generally preferred to the quadratic penalty method since there is little extra computational cost and the parameter
μ
need not go to infinity, thus avoiding ill-conditioning.

The alternating direction method of multipliers (ADMM) is a variant of the augmented Lagrangian scheme that uses partial updates for the dual variables. This method is often applied to solve problems such as

min
x
f
(
x
)
+
g
(
x
)
.

This is equivalent to the constrained problem

min
x
,
y
f
(
x
)
+
g
(
y
)
,
subject to
x
=
y
.

Though this change may seem trivial, the problem can now be attacked using methods of constrained optimization (in particular, the augmented Lagrangian method), and the objective function is separable in *x* and *y*. The dual update requires solving a proximity function in *x* and *y* at the same time; the ADMM technique allows this problem to be solved approximately by first solving for *x* with *y* fixed, and then solving for *y* with *x* fixed. Rather than iterate until convergence (like the Jacobi method), the algorithm proceeds directly to updating the dual variable and then repeating the process. This is not equivalent to the exact minimization, but surprisingly, it can still be shown that this method converges to the right answer (under some assumptions). Because of this approximation, the algorithm is distinct from the pure augmented Lagrangian method.

The ADMM can be viewed as an application of the Douglas-Rachford splitting algorithm, and the Douglas-Rachford algorithm is in turn an instance of the Proximal point algorithm; details can be found here. There are several modern software packages that solve Basis pursuit and variants and use the ADMM; such packages include YALL1 (2009), SpaRSA (2009) and SALSA (2009).

Stochastic optimization considers the problem of minimizing a loss function with access to noisy samples of the (gradient of the) function. The goal is to have an estimate of the optimal parameter (minimizer) per new sample. ADMM is originally a batch method. However, with some modifications it can also be used for stochastic optimization. Since in stochastic setting we only have access to noisy samples of gradient, we use an inexact approximation of the Lagrangian as

L
^
ρ
,
k
=
f
1
(
x
k
)
+
⟨
∇
f
(
x
k
,
ζ
k
+
1
)
,
x
⟩
+
g
(
y
)
−
z
T
(
A
x
+
B
y
−
c
)
+
ρ
2
∥
A
x
+
B
y
−
c
∥
2
+
∥
x
−
x
k
∥
2
2
η
k
+
1
,

where
η
k
+
1
is a time-varying step size.

The alternating direction method of multipliers (ADMM) is a popular method for online and distributed optimization on a large scale, and is employed in many applications, e.g. ADMM is often applied to solve regularized problems, where the function optimization and regularization can be carried out locally, and then coordinated globally via constraints. Regularized optimization problems are especially relevant in the high dimensional regime since regularization is a natural mechanism to overcome ill-posedness and to encourage parsimony in the optimal solution, e.g., sparsity and low rank. Due to the efficiency of ADMM in solving regularized problems, it has a good potential for stochastic optimization in high dimensions. However, conventional stochastic ADMM methods suffer from curse of dimensionality. Their convergence rate is proportional to square of the dimension and in practice they scale poorly. See figure REASON vs Stochastic ADMM

Recently, a general framework has been proposed for stochastic optimization in high-dimensions that solves this bottleneck by adding simple and cheap modifications to ADMM., The method is called REASON (Regularized Epoch-based Admm for Stochastic Optimization in high-dimensioN). The modifications are in terms of added projection which goes a long way and results in logarithmic dimension dependency. REASON can be performed on any regularized optimization with any number of regularizers. The specific cases of sparse optimization framework and noisy decomposition framework are discussed further. In both cases, REASON obtains minimax optimal convergence rate. REASON provides the first online guarantees for noisy matrix decomposition. Experiment results show that in aforementioned cases, REASON outperforms state-of-the-art.

Some well-known software packages that use the augmented Lagrangian method are LANCELOT and PENNON. The software MINOS also uses an augmented Lagrangian method for some types of problems. The code for REASON is available online.