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

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

Distributed Stochastic Subgradient Projection Algorithms for Convex Optimization

Open access
Sundhar Ram, S., Nedić, A., Veeravalli, V. V. · 2010 · Journal of Optimization Theory and Applications

Abstract

We consider a distributed multi-agent network system where the goal is to minimize a sum of convex objective functions of the agents subject to a common convex constraint set. Each agent maintains an iterate sequence and communicates the iterates to its neighbors. Then, each agent combines weighted averages of the received iterates with its own iterate, and adjusts the iterate by using subgradient information (known with stochastic errors) of its own function and by projecting onto the constraint set.The goal of this paper is to explore the effects of stochastic subgradient errors on the convergence of the algorithm. We first consider the behavior of the algorithm in mean, and then the convergence with probability 1 and in mean square. We consider general stochastic errors that have uniformly bounded second moments and obtain bounds on the limiting performance of the algorithm in mean for diminishing and non-diminishing stepsizes. When the means of the errors diminish, we prove that there is mean consensus between the agents and mean convergence to the optimum function value for diminishing stepsizes. When the mean errors diminish sufficiently fast, we strengthen the results to consensus and convergence of the iterates to an optimal solution with probability 1 and in mean square.

Overview

Integrity signals

Registry

Crossref · 10.1007/s10957-010-9737-7

Cites

45 of 45 references verified0 citation errors · 0 not checkable

Statistics

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

Verification

Claims the paper makes

We couldn’t retrieve this paper’s full text, 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 45 references

Cited by

See all 814

Metadata

Authors
Sundhar Ram, S., Nedić, A., & Veeravalli, V. V.
Affiliations
University of Illinois Urbana-Champaign (US)
Corresponding author
Nedić, A.
Venue
Journal of Optimization Theory and Applications
Published
2010-07-22
Volume
147
Issue
3
Pages
516-545
ISSN
  • 0022-3239 (ISSN-L)
  • 1573-2878
OpenAlex
W2066332749
Cited by
814
References
45
Citations by year
2026: 17 · 2025: 43 · 2024: 55 · 2023: 43 · 2022: 48 · 2021: 54 · 2020: 78 · 2019: 64 · 2018: 74 · 2017: 58 · 2016: 60 · 2015: 57 · 2014: 42 · 2013: 44 · 2012: 35
FWCI
51.94
Type
journal article
Language
en
Open access
Licence
www.springer.com/tdm (tdm)
Locations
  • Journal of Optimization Theory and Applications (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • RePEc: Research Papers in Economics (submittedVersion)
  • arXiv (Cornell University)
Topics
  • Physical Sciences › Engineering › Control and Systems Engineering › Distributed Control Multi-Agent Systems
  • Physical Sciences › Computer Science › Computational Theory and Mathematics › Optimization and Variational Analysis
  • Physical Sciences › Computer Science › Artificial Intelligence › Stochastic Gradient Optimization Techniques
Keywords
distributed optimization, multi-agent systems, projection onto convex sets, consensus, mean square convergence, almost sure convergence, convex optimization

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: Distributed Stochastic Subgradient Projection Algorithms for Convex Optimization. https://app.cochat.ai/papers/10.1007/s10957-010-9737-7
The paper
Sundhar Ram, S., Nedić, A., & Veeravalli, V. V. (2010). Distributed Stochastic Subgradient Projection Algorithms for Convex Optimization. Journal of Optimization Theory and Applications. https://doi.org/10.1007/s10957-010-9737-7

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.