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

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

A Proximal Gradient Algorithm for Decentralized Composite Optimization

Shi, Wei, Ling, Qing, Wu, Gang, Yin, Wotao · 2015 · IEEE Transactions on Signal Processing

Abstract

This paper proposes a decentralized algorithm for solving a consensus optimization problem defined in a static networked multi-agent system, where the local objective functions have the smooth+nonsmooth composite form. Examples of such problems include decentralized constrained quadratic programming and compressed sensing problems, as well as many regularization problems arising in inverse problems, signal processing, and machine learning, which have decentralized applications. This paper addresses the need for efficient decentralized algorithms that take advantages of proximal operations for the nonsmooth terms. We propose a proximal gradient exact first-order algorithm (PG-EXTRA) that utilizes the composite structure and has the best known convergence rate. It is a nontrivial extension to the recent algorithm EXTRA. At each iteration, each agent locally computes a gradient of the smooth part of its objective and a proximal map of the nonsmooth part, as well as exchanges information with its neighbors. The algorithm is “exact” in the sense that an exact consensus minimizer can be obtained with a fixed step size, whereas most previous methods must use diminishing step sizes. When the smooth part has Lipschitz gradients, PG-EXTRA has an ergodic convergence rate of O(1/k) in terms of the first-order optimality residual. When the smooth part vanishes, PG-EXTRA reduces to P-EXTRA, an algorithm without the gradients (so no “G” in the name), which has a slightly improved convergence rate at o(1/k) in a standard (non-ergodic) sense. Numerical experiments demonstrate effectiveness of PG-EXTRA and validate our convergence results.

Overview

Integrity signals

Registry

Crossref · 10.1109/tsp.2015.2461520

Cites

36 of 36 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

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?

Citations

Cites

Show all 36 references

Research works printed but not linked: 3

  1. davis, 2014, ?Convergence rates of relaxed Peaceman-Rachford and ADMM under regularity assumptions ?
  2. deng, 2013, ?Parallel multi-block ADMM with convergence ?
  3. 2011, Foundations of Location Analysis

Cited by

See all 368

Metadata

Authors
Shi, W., Ling, Q., 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
2015-11
Volume
63
Issue
22
Pages
6013-6023
ISSN
  • 1053-587X (ISSN-L)
  • 1941-0476
OpenAlex
W1627780903
Cited by
307
References
36
Citations by year
2026: 17 · 2025: 30 · 2024: 31 · 2023: 28 · 2022: 36 · 2021: 35 · 2020: 41 · 2019: 27 · 2018: 28 · 2017: 19 · 2016: 15
FWCI
23.64
Type
journal article
Language
en
Open access
closed
Locations
IEEE Transactions on Signal Processing (publishedVersion)
Funders
  • National Natural Science Foundation of China (61004137, 61573331)
  • National Science Foundation (DMS-1317602)
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 › Computational Theory and Mathematics › Optimization and Variational Analysis
Keywords
distributed optimization, consensus optimization, multi-agent systems, proximal gradient method, composite objective function, nonsmooth optimization, fixed step size, ergodic convergence rate, compressed sensing, regularization

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: A Proximal Gradient Algorithm for Decentralized Composite Optimization. https://app.cochat.ai/papers/10.1109/tsp.2015.2461520
The paper
Shi, W., Ling, Q., Wu, G., & Yin, W. (2015). A Proximal Gradient Algorithm for Decentralized Composite Optimization. IEEE Transactions on Signal Processing. https://doi.org/10.1109/tsp.2015.2461520

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.