Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 363

The DOI matches its Crossref record; 54 of the 54 references it cites were found in a registry or an index.

D-ADMM: A Communication-Efficient Distributed Algorithm for Separable Optimization

Open access
Mota, Joao F. C., Xavier, Joao M. F., Aguiar, Pedro M. Q., Puschel, Markus·2013·IEEE Transactions on Signal Processing

Abstract

We propose a distributed algorithm, named Distributed Alternating Direction Method of Multipliers (D-ADMM), for solving separable optimization problems in networks of interconnected nodes or agents. In a separable optimization problem there is a private cost function and a private constraint set at each node. The goal is to minimize the sum of all the cost functions, constraining the solution to be in the intersection of all the constraint sets. D-ADMM is proven to converge when the network is bipartite or when all the functions are strongly convex, although in practice, convergence is observed even when these conditions are not met. We use D-ADMM to solve the following problems from signal processing and control: average consensus, compressed sensing, and support vector machines. Our simulations show that D-ADMM requires less communications than state-of-the-art algorithms to achieve a given accuracy level. Algorithms with low communication requirements are important, for example, in sensor networks, where sensors are typically battery-operated and communicating is the most energy consuming operation.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

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

Integrity signals

Registry

Crossref · 10.1109/tsp.2013.2254478

Cites

54 of 54 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.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

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

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

Cited by

See all 363

Metadata

Authors
Mota, J. F. C., Xavier, J. M. F., Aguiar, P. M. Q., & Puschel, M.
Venue
IEEE Transactions on Signal Processing
Published
2013-05
Volume
61
Issue
10
Pages
2718-2723
ISSN
  • 1053-587X (ISSN-L)
  • 1941-0476
OpenAlex
W1982545958
Cited by
363
References
54
FWCI
37.01
Type
journal article
Language
en
Open access
green

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: D-ADMM: A Communication-Efficient Distributed Algorithm for Separable Optimization. https://app.cochat.ai/papers/10.1109/tsp.2013.2254478
The paper
Mota, J. F. C., Xavier, J. M. F., Aguiar, P. M. Q., & Puschel, M. (2013). D-ADMM: A Communication-Efficient Distributed Algorithm for Separable Optimization. IEEE Transactions on Signal Processing. https://doi.org/10.1109/tsp.2013.2254478

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.