The alternating direction method of multipliers (ADMM) algorithm[1] solves problems of the form,
minimizesubject tof(x)+g(z)Ax+Bz=c The iterates of ADMM are defined by the augmented Lagrangian,
Lρ(x,z,y)=f(x)+g(z)+y⊤(Ax+Bz−c)+(ρ/2)∥Ax+Bz−c∥22, and consist of,
xk+1zk+1yk+1:=xargminLρ(x,zk,yk):=zargminLρ(xk+1,z,yk):=yk+ρ(Axk+1+Bzk+1−c) Note that the method of multipliers algorithm considers the update of x,z jointly, whereas ADMM takes a Gauss-Seidel pass. An often more convenient scaled form may be obtained by completing the square with the dual variable and residual (r=Ax+Bz−c), and defining the scaled dual variable u=(1/ρ)y.
y⊤r+(ρ/2)∥r∥22==2ρ[ρ2y⊤r+r⊤r+ρ21y⊤y−ρ21y⊤y]2ρ∥r+u∥22−2ρ∥u∥22 With the scaled dual variable, our augmented Lagrangian is written as,
Lρ(x,z,u)=f(x)+g(z)+(ρ/2)∥Ax+Bz−c+u∥22−(ρ/2)∥u∥22, and the ADMM iterates are expressed as,
Scaled Form ADMM xk+1zk+1uk+1:=xargminf(x)+(ρ/2)∥Ax+Bzk−c+uk∥22:=zargming(z)+(ρ/2)∥Axk+1+Bz−c+uk∥22:=uk+Axk+1+Bzk+1−c The ADMM iterates written in scaled form are often more amenable to being written with proximal operators.