On the Linear Convergence of the ADMM in Decentralized Consensus Optimization
Open accessThe DOI matches its Crossref record; 34 of the 34 references it cites were found in a registry or an index.
Abstract
In decentralized consensus optimization, a connected network of agents collaboratively minimize the sum of their local objective functions over a common decision variable, where their information exchange is restricted between the neighbors. To this end, one can first obtain a problem reformulation and then apply the alternating direction method of multipliers (ADMM). The method applies iterative computation at the individual agents and information exchange between the neighbors. This approach has been observed to converge quickly and deemed powerful. This paper establishes its linear convergence rate for the decentralized consensus optimization problem with strongly convex local objective functions. The theoretical convergence rate is explicitly given in terms of the network topology, the properties of local objective functions, and the algorithm parameter. This result is not only a performance guarantee but also a guideline toward accelerating the ADMM convergence.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“The augmented Lagrangian based primal-dual methods have linear convergence under strong convexity and Lipschitz gradient assumptions [4,30] or under the positive-definite bounded Hessian assumption [12,13].”
From EXTRA: An Exact First-Order Algorithm for Decentralized Consensus Optimization (2015) · cites this paper as [30]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“Under the strong convexity assumption, the decentralized ADMM has been shown to have linear convergence for time-invariant undirected graphs [63].”
From Achieving Geometric Convergence for Distributed Optimization Over Time-Varying Graphs (2017) · cites this paper as [63]
Experimental — accuracy not yet measured
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Chung, F. (1996) · CBMS Regional Conference Series in Mathematics · doi:10.1090/cbms/092 · Cited by 5,524
Parallel and Distributed Computation: Numerical Methods
Bertsekas, D. P., & Tsitsiklis, J. N. (1989) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 5,293
Algebraic connectivity of graphs
Fiedler, M. (1973) · Czechoslovak Mathematical Journal · doi:10.21136/cmj.1973.101168 · Cited by 3,977
Distributed Subgradient Methods for Multi-Agent Optimization
Nedic, A., & Ozdaglar, A. (2009) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2008.2009515 · Cited by 3,719 · cited 3×
“they do not rely on any predefined structures. Subgradient descent and dual ave raging work well for asynchronous networks but suffer from slow convergence. Indeed, for subgradient descent algorithms [15] and [16] establish the convergence rate of O(1/k), where k is the number of iterations, to a neighborhood of the op…”
BackgroundMethodInfluentialInformation consensus in multivehicle cooperative control
(2007) · IEEE Control Systems · doi:10.1109/mcs.2007.338264 · Cited by 3,156
Distributed average consensus with least-mean-square deviation
Xiao, L., Boyd, S., & Kim, S.-J. (2007) · Journal of Parallel and Distributed Computing · doi:10.1016/j.jpdc.2006.08.010 · Cited by 1,107
Optimal decentralized protocol for electric vehicle charging
Gan, L., Topcu, U., & Low, S. H. (2013) · IEEE Transactions on Power Systems · doi:10.1109/tpwrs.2012.2210288 · Cited by 997
Dual Averaging for Distributed Optimization: Convergence Analysis and Network Scaling
Duchi, J. C., Agarwal, A., & Wainwright, M. J. (2012) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2011.2161027 · Cited by 947
Dual Averaging for Distributed Optimization: Convergence Analysis and Network Scaling
Duchi, J. C., Agarwal, A., & Wainwright, M. J. (2010) · Cited by 884
On the $O(1/n)$ Convergence Rate of the Douglas–Rachford Alternating Direction Method
He, B., & Yuan, X. (2012) · SIAM Journal on Numerical Analysis · doi:10.1137/110836936 · Cited by 881
Cited by
Items 901–952 of 952
A New Decomposition Paradigm for Graph-structured Nonlinear Programs via Message PassingPreprint
Ding, K., Maros, M., & Scutari, G. (2025) · arXiv (Cornell University) · doi:10.48550/arxiv.2512.24676
Lee, W., & Park, B. (2026) · IEEE Access · doi:10.1109/access.2026.3652328
Och, A., & Ulbig, A. (2025) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc57313.2025.11312611
Two-timescale EXTRA for Distributed Smooth Non-convex Optimization
Peng, Z., Farokhi, F., & Pu, Y. (2025) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc57313.2025.11312554
Lei, 徐. X., & Jian, 孔. K. (2026) · Laser & Optoelectronics Progress · doi:10.3788/lop250867
Tang, R., Li, H., Xia, D., Ran, L., Li, J., & Zhu, W. (2026) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2026.102282
Anderson Acceleration for Distributed Constrained Optimization over Time-varying NetworksPreprint
Liu, H., & Wu, X. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2601.12398
An Accelerated Control Strategy for Dynamical Systems with Reduced Communication Cost
Hu, C., Xiang, C., & Wu, Q. (2025) · IEEE Transportation Electrification Conference and Expo, Asia-Pacific (ITEC Asia-Pacific) · doi:10.1109/itecasia-pacific63742.2025.11344911
Decentralized Primal--Dual Optimization Without Global Lipschitz Continuity
Wang, L., Yang, S., & Zhang, M.-L. (2026) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2026.3656728
Federated Gaussian Process Learning via Pseudo-Representations for Large-Scale Multi-Robot Systems
Salunkhe, S. A., & Kontoudis, G. P. (2026) · Adaptive Agents and Multi-Agents Systems · doi:10.65109/yqea8075
Primal-Dual Strategy for Composite Optimization Over Directed Graphs
Zandi, S., Esfandiari, M., & Zhao, S. (2026) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2026.3667777
Riemannian Momentum Tracking: Distributed Optimization With Momentum on Compact Submanifolds
Chen, J., Zhu, T., Ye, H., Liu, L., Dai, G., Liu, Y., Jiang, Y., & Tsang, I. W.-H. (2026) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2026.3667761
Mokhtari, Y. (2025) · arXiv (Cornell University) · doi:10.48550/arxiv.2508.11078
A Unifying Primal-Dual Proximal Framework for Distributed Nonconvex OptimizationPreprint
Ou, Z., & Lu, J. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2603.09524
Zhang, Z., Dong, L., Guo, J., & Jiang, J. (2026) · IEEE Transactions on Mobile Computing · doi:10.1109/tmc.2026.3673419
Last-iterate Convergence of ADMM on Multi-affine Quadratic Equality Constrained ProblemPreprint
Chao, Y., Ciebielski, M., Etesami, J., & Khadiv, M. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2603.11919
Robust Self-Localization of Wireless Acoustic Sensor Networks in the Presence of TDoA Outliers
Hu, D., & Wang, X. (2026) · IEEE Transactions on Mobile Computing · doi:10.1109/tmc.2026.3676429
Distributed Dual Coordinate Ascent in a Ring Network for Distributed Machine Learning Process
Cho, M., Ali, S., Asadinia, M., Lai, L., & Xu, W. (2025) · Asilomar Conference on Signals, Systems and Computers (ACSSC) · doi:10.1109/ieeeconf67917.2025.11443696
Recent advances in distributed statistical learning
Liu, W., Mao, X., & Yu, Z. (2026) · Scientia Sinica Mathematica · doi:10.1360/ssm-2025-0292
Differential Privacy for Decentralized Learning
Cyffers, E. (2024) · theses.fr (ABES) · doi:10.70675/a3e85b6ezd607z4616zb7f1zdd23c24f937c
Effect of basis choice on quantitative parameter estimation in accelerated subspace reconstructions
Bai, H., Dai, K., Qiu, Y., Bao, J., Wang, X., Zhang, Y., Chen, H., Zhang, Z., & Lee, P. K. (2026) · Magnetic Resonance Letters · doi:10.1016/j.mrl.2026.200274
Hypernetwork-Aided Unfolded D-Admm: Adaptive Parameterization for Distributed Optimization
Shraga, O., Tapiro, T., & Shlezinger, N. (2026) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp55912.2026.11464431
Achieving Linear Speed-Up for Distributed Inexact-ADMM
Alghunaim, S. A. (2026) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp55912.2026.11464979
Distributed Zeroth-Order Optimization with Rademacher Perturbations and Momentum Gradient TrackingPreprint
Su, Y., Tong, X., & Sun, C. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2604.21368
Improving semidefinite programming for NP-hard nonlinear numerical optimization problems
Kadhim, F. J., & Al-Jilawi, A. S. (2026) · AIP conference proceedings · doi:10.1063/5.0329914
An Adaptive Decentralized Quasi-Newton Method with Stepsizes Independent of the Local-Update BudgetPreprint
Wu, H., & Wang, L. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2606.09070
Auction-Driven ADMM Framework for Plan Consensus in Integrated Ground–Air Mobility
Kim, H., Ryu, S.-K., & Choi, H. (2026) · International Journal of Aeronautical and Space Sciences · doi:10.1007/s42405-026-01220-9
Efficient Sparse DOA Estimation in Collocated Large-Scale Arrays via Consensus Optimization
Jia, X., Wu, X., & Zhu, W. (2026) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2026.3703970
An Exponentially Stable Discrete-Time Primal-Dual Algorithm for Distributed Constrained Optimization
Ren, X., Bin, M., Notarnicola, I., & Parisini, T. (2026) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2026.3707505
Decentralized ADMM for factorization-based Low-rank matrix estimation
Song, Z., Zhao, W., Li, R., & Lian, H. (2026) · Neural Networks · doi:10.1016/j.neunet.2026.109319
Distributed implementation of DeePC for multi-input LTI systems over directed graphs
Sun, Z., Duan, Z., Lyu, X., & Shi, L. (2026) · Automatica · doi:10.1016/j.automatica.2026.113161
Wang, Y., Sun, W., Wang, W. Y., & Zhang, T. (2026) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2026.3711820
Decentralized Elastic-Net Broad Learning System over Directed Graphs
Liang, J., & Zhou, M. (2026) · Journal of Computer and Communications · doi:10.4236/jcc.2026.147008
Distributed Convolutional Rank Regression over Decentralized NetworksPreprint
Li, C., Zhao, T., & Yuan, X. (2026) · SSRN Electronic Journal · doi:10.2139/ssrn.7602428
Achievable Information Rate in Distributed Antenna-Assisted WPCNs With Short-Packet Communications
Li, D., Xiong, K., Chen, W., Fan, P., Ng, D. W. K., & Letaief, K. B. (2026) · IEEE Internet of Things Journal · doi:10.1109/jiot.2026.3724929
Learning the Heuristics of Hub Identification over Brain Networks
Chen, A. (2026) · Scientific Journal of Technology · doi:10.54691/y6py3q21
Decentralized low tubal rank tensor estimation via factorized gradient tracking
Song, Z., Peng, L., Zhao, W., & Lian, H. (2026) · Neurocomputing · doi:10.1016/j.neucom.2026.134884
Research on Vision-Based Multi-robot Cooperative Localisation and Mapping System
Zheng, F., Li, R., Shi, Y., & Shi, Y. (2026) · Lecture notes in electrical engineering · doi:10.1007/978-981-92-4392-1_19
Xue, Z., & Dang, Y. (2026) · Research Square · doi:10.21203/rs.3.rs-10877139/v1
Similarity-Promoting Resilient Adaptive Aggregation in Peer-to-Peer Machine Learning
Bhowmick, C., & Koutsoukos, X. (2026) · Machine Learning · doi:10.1007/s10994-026-07162-3
Approximate Newton Methods for Distributed Learning over Communication-Constrained Wireless Networks
Sharma, G. (2025) · Maynooth University ePrints and eTheses Archive (Maynooth University)
Weissteiner, D., Demelius, L., & Trügler, A. (2026) · Computer Communications · doi:10.1016/j.comcom.2026.108666
Wei, M., Zhu, M., Chen, J., Yu, W., & Che, D. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2609.29446
From Mixing to Tearing: Graph Decomposition in Decentralized Optimization via Message PassingPreprint
Ding, K., & Scutari, G. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2610.03709
Communication efficient large scale distributed optimization with curvature acceleration
Li, Y. (2022) · Illinois Digital Environment for Access to Learning and Scholarship (University of Illinois at Urbana-Champaign)
Comprehensive Survey of Distributed Optimization: Challenges, Strategies, and Applications
Luo, B. (2026) · Journal of Machine Learning and Information Security · doi:10.53941/jmlis.2026.100021
Train Locally, Learn Together: Distributed Multi-Agent Training via ADMMPreprint
Chen, Y.-W., Wang, C.-S., Lang, Y.-C., Qu, Q., Hero, A., & Liu, S.-J. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2610.24380
Accelerated consensus via Min-Sum Splitting
Tatikonda, S., & Rebeschini, P. (2018) · Oxford University Research Archive (ORA) (University of Oxford)
Pan, Z. (2025) · Oxford University Research Archive (ORA) (University of Oxford)
Islam, M. K., Islam, M. M., Orpa, J. B., & Yun, J. (2026) · Sensors · doi:10.3390/s26216980
Hybrid Consensus ADMM for Multi-robot Task Allocation via a Minimum Dominating Set
Jang, S., & Shin, H.-S. (2026) · Lecture notes in networks and systems · doi:10.1007/978-3-032-23010-2_42
Optimal last-iterate rates for the projected decentralized stochastic subgradient methodPreprint
Wu, H., Yin, C., Dai, Y., & Wang, L. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2611.11992
Metadata
- Authors
- Shi, W., Ling, Q., Yuan, K., Wu, G., & Yin, W.
- Affiliations
- University of Science and Technology of China (CN)
- University of California, Los Angeles (US)
- Venue
- IEEE Transactions on Signal Processing
- Published
- 2014-04
- Volume
- 62
- Issue
- 7
- Pages
- 1750-1761
- ISSN
- 1053-587X (ISSN-L)
- 1941-0476
- OpenAlex
- W2123705108
- Cited by
- 820
- References
- 34
- Citations by year
- 2026: 36 · 2025: 55 · 2024: 48 · 2023: 81 · 2022: 66 · 2021: 83 · 2020: 98 · 2019: 97 · 2018: 90 · 2017: 61 · 2016: 54 · 2015: 33 · 2014: 15
- FWCI
- 62.48
- Type
- journal article
- Language
- en
- Open access
- green
- arxiv.org
- Locations
- IEEE Transactions on Signal Processing (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- arXiv (Cornell University)
- Topics
- Physical Sciences › Engineering › Control and Systems Engineering › Distributed Control Multi-Agent Systems
- Physical Sciences › Computer Science › Signal Processing › Sparse and Compressive Sensing Techniques
- Physical Sciences › Computer Science › Artificial Intelligence › Stochastic Gradient Optimization Techniques
- Keywords
- alternating direction method of multipliers, linear convergence, network topology, distributed optimization, convergence acceleration, multi-agent systems
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.