The alternating direction method of multipliers (ADMM) minimises a sum of two terms that are easy to handle separately:
With penalty parameter and the scaled dual variable , the iteration is
initialised for example with and (see Proximal Operator). The same appears in both proximal steps; it is the penalty of the augmented Lagrangian .
Convergence. For closed, proper, convex , the residuals , the objective converges to the optimum, and converges to a dual solution, for any . The choice of affects speed. Residual balancing adapts it: increase if the primal residual dominates, and decrease it if the dual residual dominates. For nonconvex , such as the EIT misfit, convergence is only guaranteed under extra assumptions, but ADMM often works well in practice.
Stopping. Stop when both the primal residual and the dual residual are small.
In EIT. is the data misfit, whose prox is computed iteratively, and is a regulariser with a cheap prox (Total Variation, Tikhonov Regularization, box constraints) or a learned denoiser (Plug-and-Play Priors, Diffusion Proximal Operator). See Nested ADMM Reconstruction.
In ModularEIT.jl: ADMM.
References
- S. Boyd, N. Parikh, E. Chu, B. Peleato, J. Eckstein (2011). Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers. Found. Trends Mach. Learn. 3(1), 1–122. doi:10.1561/2200000016
- Y. Wang (2022). Anisotropic TV Regularization in Electrical Impedance Tomography: An Experimental Study. Engineering 14(3), 138–146. doi:10.4236/eng.2022.143013
- C. Park, S. Shoushtari, W. Gan, U. S. Kamilov (2023). Convergence of Nonconvex PnP-ADMM with MMSE Denoisers. IEEE CAMSAP 2023, 511–515. doi:10.1109/CAMSAP58249.2023.10403463