CoChat

On the Linear Convergence of the ADMM in Decentralized Consensus Optimization

Open access
Shi, Wei, Ling, Qing, Yuan, Kun, Wu, Gang, Yin, Wotao · 2014 · IEEE Transactions on Signal Processing

The 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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/tsp.2014.2304432

Cites

34 of 34 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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?

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

Show all 34 references

Cited by

See all 952

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
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

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: On the Linear Convergence of the ADMM in Decentralized Consensus Optimization. https://app.cochat.ai/papers/10.1109/tsp.2014.2304432
The paper
Shi, W., Ling, Q., Yuan, K., Wu, G., & Yin, W. (2014). On the Linear Convergence of the ADMM in Decentralized Consensus Optimization. IEEE Transactions on Signal Processing. https://doi.org/10.1109/tsp.2014.2304432

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.