Methods › General › Optimization › ADMM

Alternating Direction Method of Multipliers

ADMM

398 papers tagged archive 2025-07-28

archive 2025-07-28 Description, source and code snippet are the archive's method entry.

The alternating direction method of multipliers (ADMM) is an algorithm that solves convex optimization problems by breaking them into smaller pieces, each of which are then easier to handle. It takes the form of a decomposition-coordination procedure, in which the solutions to small local subproblems are coordinated to find a solution to a large global problem. ADMM can be viewed as an attempt to blend the benefits of dual decomposition and augmented Lagrangian methods for constrained optimization. It turns out to be equivalent or closely related to many other algorithms as well, such as Douglas-Rachford splitting from numerical analysis, Spingarn’s method of partial inverses, Dykstra’s alternating projections method, Bregman iterative algorithms for l1 problems in signal processing, proximal methods, and many others.

Text Source: https://stanford.edu/~boyd/papers/pdf/admm_distr_stats.pdf

Image Source: here

Papers archive 2025-07-28

30 shown of 398, newest first. Repository counts are the archive's code-links table. A Syntology line states what Syntology ran from that paper's harvested code; it is per sample and not a correctness claim.

Tasks archive 2025-07-28

20 shown of 180 tasks the archive attaches to papers tagged with this method, by distinct papers. A task without a page in the catalog is plain text.

TaskPapers
Denoising30
Distributed Optimization24
Clustering18
BIG-bench Machine Learning15
Federated Learning15
Image Reconstruction15
Quantization15
Image Restoration14
Image Denoising13
regression13
Computational Efficiency11
Deep Learning11
Model Compression10
Super-Resolution10
compressed sensing10
Deblurring9
Image Classification9
Privacy Preserving9
Segmentation8
Semantic Segmentation8

Usage over time archive 2025-07-28

Papers per year tagged with ADMM: 2013 to 2025, peak 59 59 0 2013: 10 papers 2013 2014: 12 papers 2014 2015: 17 papers 2015 2016: 22 papers 2016 2017: 26 papers 2017 2018: 28 papers 2018 2019: 59 papers 2019 2020: 43 papers 2020 2021: 38 papers 2021 2022: 41 papers 2022 2023: 46 papers 2023 2024: 34 papers 2024 2025: 22 papers 2025
Papers per year the archive tags with this method, by the paper's archive date (398 dated). Bars are counts, not a trend claim.

Components: the archive holds no method-to-method composition, so PwC's Components table cannot be rebuilt; the Papers list carries no Results column for the same reason (the archive does not join its leaderboard rows to method tags).

Categories archive 2025-07-28

Optimization

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections