The DOI matches its Crossref record; 28 of the 28 references it cites were found in a registry or an index.
Distributed Subgradient Methods for Convex Optimization Over Random Networks
Abstract
We consider the problem of cooperatively minimizing the sum of convex functions, where the functions represent local objective functions of the agents. We assume that each agent has information about his local function, and communicate with the other agents over a time-varying network topology. For this problem, we propose a distributed subgradient method that uses averaging algorithms for locally sharing information among the agents. In contrast to previous works on multi-agent optimization that make worst-case assumptions about the connectivity of the agents (such as bounded communication intervals between nodes), we assume that links fail according to a given stochastic process. Under the assumption that the link failures are independent and identically distributed over time (possibly correlated across links), we provide almost sure convergence results for our subgradient algorithm.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Citations
Cites
Consensus Problems in Networks of Agents With Switching Topology and Time-Delays
Olfati-Saber, R., & Murray, R. M. (2004) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2004.834113 · Cited by 12,788 · cited 1×
“[10], OlfatiSaber and Murray [16], Cao et al.”
BackgroundCoordination 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
Novel Type of Phase Transition in a System of Self-Driven Particles
Vicsek, T., Czirók, A., Ben-Jacob, E., Cohen, I., & Shochet, O. (1995) · Physical Review Letters · doi:10.1103/physrevlett.75.1226 · Cited by 7,380
Parallel and Distributed Computation: Numerical Methods
Bertsekas, D. P., & Tsitsiklis, J. N. (1989) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 5,293
Rate control for communication networks: shadow prices, proportional fairness and stability
Kelly, F. P., Maulloo, A. K., & Tan, D. K. H. (1998) · Journal of the Operational Research Society · doi:10.1057/palgrave.jors.2600523 · Cited by 5,021 · cited 1×
“[11], Low and Lapsley [12], Srikant [20], and Chiang et al.”
BackgroundDistributed 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 6×
“[23], Bertsekas and Tsitsiklis [2]), which developed a general framework for parallel and distributed computation among different processors, and on the recent work by Nedić and Ozdaglar [14], which studied a distributed method for cooperative optimization in multi-agent environments.”
BackgroundMethodResultInfluentialSelf-citationRate control for communication networks: shadow prices, proportional fairness and stability
Kelly, F. P., Maulloo, A. K., & Tan, D. K. H. (1998) · Journal of the Operational Research Society · doi:10.1038/sj.jors.2600523 · Cited by 2,399
Convex 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 · cited 1×
“The following lemma on the infinite sum of products of the components of two sequences will also be used in establishing our convergence results (see Lemma 7 in [15] for the proof).”
BackgroundSelf-citationOptimization flow control. I. Basic algorithm and convergence
Low, S. H., & Lapsely, D. E. (1999) · IEEE/ACM Transactions on Networking · doi:10.1109/90.811451 · Cited by 1,972 · cited 1×
“[11], Low and Lapsley [12], Srikant [20], and Chiang et al.”
Background
Research works printed but not linked: 1
- bertsimas, 1985, Linear Optimization
Cited by
An Overview of Recent Progress in the Study of Distributed Multi-Agent Coordination
Cao, Y., Yu, W., Ren, W., & Chen, G. (2013) · IEEE Transactions on Industrial Informatics · doi:10.1109/tii.2012.2219061 · Cited by 2,399
“Further results on this topic can be found in [111]–[113], where a similar distributed multi-agent optimization problem was studied within various scenarios, under constraints [111], over random networks [112], and with broadcast-based communications in an asynchronous setting [113].”
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
“2364096 Distributed optimization of a sum of convex functions has received a surge of interest in recent years [3], [5], [8], [11]– [13], [15], [23], [27].”
A survey of distributed optimization
Yang, T., Yi, X., Wu, J., Yuan, Y., Wu, D., Meng, Z., Hong, Y., Wang, H., Lin, Z., & Johansson, K. H. (2019) · Annual Reviews in Control · doi:10.1016/j.arcontrol.2019.05.006 · Cited by 913
“In summary, the existing distributed algorithms for random graphs either use the gradient information (see, e.g., Jakoveti ´c et al., 2014a; Lobel & Ozdaglar, 2011; Wu, Yang, Wu et al., 2017 ) and diminishing step-sizes or fixed step-sizes and the Hessian information (see, e.g., Carli et al., 2015;…”
BackgroundMethodOpinion Dynamics and Learning in Social Networks
Acemoglu, D., & Ozdaglar, A. (2011) · Dynamic Games and Applications · doi:10.1007/s13235-010-0004-1 · Cited by 705
“12 10 The DeGroot model and variations have also been studied extensively in the cooperative control literature as natural algorithms for achieving cooperative behavior with local information in networked-systems (see [18, 33, 62, 67, 71, 72, 87–89]).”
BackgroundSelf-citationNetwork Topology and Communication-Computation Tradeoffs in Decentralized Optimization
Nedic, A., Olshevsky, A., & Rabbat, M. G. (2018) · Proceedings of the IEEE · doi:10.1109/jproc.2018.2817461 · Cited by 534
Metadata
- Authors
- Lobel, I., & Ozdaglar, A.
- Affiliations
- New York University (US)
- Massachusetts Institute of Technology (US)
- Venue
- IEEE Transactions on Automatic Control
- Published
- 2011-06
- Volume
- 56
- Issue
- 6
- Pages
- 1291-1306
- ISSN
- 0018-9286 (ISSN-L)
- 1558-2523
- OpenAlex
- W2106901427
- Cited by
- 351
- References
- 28
- Citations by year
- 2026: 6 · 2025: 8 · 2024: 14 · 2023: 13 · 2022: 15 · 2021: 27 · 2020: 26 · 2019: 36 · 2018: 38 · 2017: 37 · 2016: 37 · 2015: 30 · 2014: 25 · 2013: 14 · 2012: 11
- FWCI
- 17.33
- Type
- journal article
- Language
- en
- Open access
- closed
- Locations
- IEEE Transactions on Automatic Control (publishedVersion)
- 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 › Signal Processing › Sparse and Compressive Sensing Techniques
- Keywords
- convex optimization, multi-agent optimization, time-varying topology, random networks, link failure, averaging algorithms, almost sure convergence, cooperative 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 Subgradient Methods for Convex Optimization Over Random Networks. https://app.cochat.ai/papers/10.1109/tac.2010.2091295
- The paper
- Lobel, I., & Ozdaglar, A. (2011). Distributed Subgradient Methods for Convex Optimization Over Random Networks. IEEE Transactions on Automatic Control. https://doi.org/10.1109/tac.2010.2091295
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.