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 accessAbstract
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
Cites
Statistics
Verification
Claims the paper makes
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?
In the citing paper
“Specifically, it is standard for a distributed subgradient method to converge at the rate of O (ln t/ √ t ) with the constant depending on the subgradient-norm upper bounds L i and the initial conditions x i (0) [25], [5].”
From Distributed Optimization Over Time-Varying Directed Graphs (2015) · cites this paper as [25]
In the citing paper
“Finally, we note that previous research [18], [25], [5] has studied the case when the matrices A ( t ) in (3) are doubly stochastic, which occurs when the directed graph sequence { G ( t ) } is regular. In this case, our polynomial bounds match the previously known results.”
From Distributed Optimization Over Time-Varying Directed Graphs (2015) · cites this paper as [25]
Citations
Cites
Rockafellar, R. T. (1970) · Princeton University Press eBooks · doi:10.1515/9781400873173 · Cited by 10,801
Coordination of groups of mobile autonomous agents using nearest neighbor rules
Jadbabaie, A., Lin, J., & Morse, A. S. (2003) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2003.812781 · Cited by 8,339
PE, & Billingsley, P. (1996) · Journal of the American Statistical Association · doi:10.2307/2291440 · Cited by 6,481
Parallel and Distributed Computation: Numerical Methods
Bertsekas, D. P., & Tsitsiklis, J. N. (1989) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 5,293
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 4×
“In the distributed subgradient algorithms of [19, 20], each agent maintains an iterate sequence and communicates the iterates to its neighbors.”
BackgroundMethodInfluentialSelf-citationConvex Analysis and Optimization
Bertsekas, D. P., Nedić, A., & Ozdaglar, A. (2003) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 2,148
Self-citationConstrained Consensus and Optimization in Multi-Agent Networks
Nedic, A., Ozdaglar, A., & Parrilo, P. A. (2010) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2010.2041686 · Cited by 2,086
Self-citationDistributed asynchronous deterministic and stochastic gradient optimization algorithms
Tsitsiklis, J., Bertsekas, D., & Athans, M. (1986) · IEEE Transactions on Automatic Control · doi:10.1109/tac.1986.1104412 · Cited by 1,967
(1989) · Choice Reviews Online · doi:10.5860/choice.26-5109 · Cited by 1,755
Hawkes, J., & Billingsley, P. (1987) · Journal of the Royal Statistical Society. Series A (General) · doi:10.2307/2982048 · Cited by 1,631
Cited by
EXTRA: An Exact First-Order Algorithm for Decentralized Consensus Optimization
Shi, W., Ling, Q., Wu, G., & Yin, W. (2015) · SIAM Journal on Optimization · doi:10.1137/14096668x · Cited by 1,261
“1) has additional constraints that force x into a bounded set, which also leads to bounded (sub)gradients and a Hessian, projected first-order algorithms are applicable [27, 37].”
BackgroundDistributed Optimization Over Time-Varying Directed Graphs
Nedic, A., & Olshevsky, A. (2015) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2014.2364096 · Cited by 1,187
“Specifically, it is standard for a distributed subgradient method to converge at the rate of O(ln t/ √ t) with the constant depending on the subgradientnorm upper bounds Li and the initial conditions xi(0) [5], [24].”
Self-citationAchieving Geometric Convergence for Distributed Optimization Over Time-Varying Graphs
Nedić, A., Olshevsky, A., & Shi, W. (2017) · SIAM Journal on Optimization · doi:10.1137/16m1084316 · Cited by 1,069
“To handle a more general (possibly time-varying) networks, distributed subgradient algorithm was proposed in [47], while its stochastic variant was studied in [56] and its asynchronous variant in [36] with provable convergence rates.”
BackgroundSelf-citationDual 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
“Our final set of experiments compares the distributed dual averaging method (DDA) that we present to the Markov incremental gradient descent (MIGD) method [11] and the distributed projected gradient method [10].”
InfluentialLian, X., Zhang, C., Zhang, H., Hsieh, C., Zhang, W., & Liu, J. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1705.09056 · Cited by 395
“…and Nedic, 2011, Sundhar Ram et al., 2010] or implicitly indicate that decentralized algorithms were much worse than centralized algorithms in terms of computational complexity and total communication complexity [Aybat et al., 2015, Lan et al., 2017, Ram et al., 2010, Zhang and Kwok, 2014].”
BackgroundMethodInfluential
Metadata
- Authors
- Sundhar Ram, S., Nedić, A., & Veeravalli, V. V.
- Affiliations
- University of Illinois Urbana-Champaign (US)
- Corresponding author
- Nedić, A.
- ORCID
- Veeravalli, V. V.
- 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
- green
- arxiv.org
- 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.