Asynchronous Broadcast-Based Convex Optimization Over a Network
The DOI matches its Crossref record; 36 of the 36 references it cites were found in a registry or an index.
Abstract
We consider a distributed multi-agent network system where each agent has its own convex objective function, which can be evaluated with stochastic errors. The problem consists of minimizing the sum of the agent functions over a commonly known constraint set, but without a central coordinator and without agents sharing the explicit form of their objectives. We propose an asynchronous broadcast-based algorithm where the communications over the network are subject to random link failures. We investigate the convergence properties of the algorithm for a diminishing (random) stepsize and a constant stepsize, where each agent chooses its own stepsize independently of the other agents. Under some standard conditions on the gradient errors, we establish almost sure convergence of the method to an optimal point for diminishing stepsize. For constant stepsize, we establish some error bounds on the expected distance from the optimal point and the expected function value. We also provide numerical results.
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×
“Since we are dealing with a random broadcast scheme for consensus, on a broader scale our work in this paper is related to the literature on distributed consensus and averaging [30], [31], [3], [12], [22], [32], [15], [18], [21].”
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
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 1×
“The agent (that has just updated the iterate) passes the iterate to a randomly selected neighbor to perform the next update.”
BackgroundBoyd, S., Ghosh, A., Prabhakar, B., & Shah, D. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2006.874516 · Cited by 2,439 · cited 1×
“As in [6], [7], [27], we find it easier to study the algorithm in terms of a single virtual clock that ticks whenever any of the local Poisson clock ticks.”
BackgroundConvex Analysis and Optimization
Bertsekas, D. P., Nedić, A., & Ozdaglar, A. (2003) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 2,148
Constrained 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×
“this paper is related to the literature on distributed consensus and averaging [10], [11], [15]–[17], [19]–[22].”
BackgroundDistributed 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
Research works printed but not linked: 2
- lobel, 2008, Distributed subgradient methods over random networks
- ram, 2010, Sensor Networks When Theory Meets Practice
Cited by
Items 301–326 of 326
Distributed Optimization Over Markovian Switching Random Network
Yi, P., & Li, L. (2020) · International Conference on Control and Automation · doi:10.1109/icca51439.2020.9264492
“Different communication models and graph connectivity assumptions, either deterministic or stochastic, have been discussed for different algorithms including uniformly joint strongly connected graphs [6], [8], quantized communication [21], random graphs [9], [22], broadcasting [23] and gossip communication [24].”
BackgroundSocial inductive biases for reinforcement learning
Adjodah, D. (2019) · DSpace@MIT (Massachusetts Institute of Technology)
Multi-agent network games with applications in smart electric mobility
Cenedese, C. (2021) · University of Groningen research database (University of Groningen / Centre for Information Technology) · doi:10.33612/diss.166885555
Distributed MPC Algorithm for Linear Discrete Systems with Communication Noise
Zhao, D., Liu, D., Liu, L., & Zhang, X. (2021) · Chinese Control Conference (CCC) · doi:10.23919/ccc52363.2021.9549658
“Lemma 1([13]).”
Multiagent Distributed Optimization and Reinforcement Learning Control
Wang, J. (2021) · Studies in systems, decision and control · doi:10.1007/978-3-030-86893-2_6
Optimal control applications and methods literature survey (Nos. 25–26)
(2011) · Optimal Control Applications and Methods · doi:10.1002/oca.1017
Primal–Dual Algorithms for Distributed Economic Dispatch
Lü, Q., Liao, X., Li, H., Deng, S., & Gao, S. (2022) · Wireless networks · doi:10.1007/978-981-19-8559-1_7
An accelerated distributed method with inexact model of relative smoothness and strong convexity
Zhang, X., Liu, S., & Zhao, N. (2023) · IET Signal Processing · doi:10.1049/sil2.12199
(2024) · Elsevier eBooks · doi:10.1016/b978-0-44-321636-7.00022-2
Li, Z., & Ding, Z. (2024) · Elsevier eBooks · doi:10.1016/b978-0-44-321636-7.00014-3
Decentralized Bayesian Learning via Langevin Dynamics
Bai, H., Bhar, K., George, J., & Busart, C. (2024) · Elsevier eBooks · doi:10.1016/b978-0-443-14081-5.00038-6
Asynchronous Algorithms in Distributed Optimization Over Multi-Agent Network
You, K., & Du, Y. (2024) · Elsevier eBooks · doi:10.1016/b978-0-443-14081-5.00084-2
Privacy-preserving decentralized optimal economic dispatch algorithms with conditional noises
Lü, Q., Liao, X., Li, H., Deng, S., Li, Y., & Zhang, K. (2025) · Elsevier eBooks · doi:10.1016/b978-0-44-333337-8.00014-7
Asynchronous decentralized algorithms for resource allocation in directed networks
Lü, Q., Liao, X., Li, H., Deng, S., Li, Y., & Zhang, K. (2025) · Elsevier eBooks · doi:10.1016/b978-0-44-333337-8.00007-x
Distributed Algorithm for Constrained Optimization with Asynchrony and Delays
Li, H., Lü, Q., Xia, D., Wang, X., Wang, Z., Zheng, L., Li, J. Q., & Ran, L. (2025) · Computational intelligence methods and applications · doi:10.1007/978-981-95-0911-9_7
Distributed Primal-Dual Fixed Point Algorithm for Multi-Block Separable Optimization
Li, H., Lü, Q., Xia, D., Wang, X., Wang, Z., Zheng, L., Li, J. Q., & Ran, L. (2025) · Computational intelligence methods and applications · doi:10.1007/978-981-95-0911-9_3
Performance-driven control theory and applications
Riggs, D. J. (2012) · eScholarship (California Digital Library)
Σχεδίαση κατανεµηµένων ελεγκτών για βέλτιστη συµφωνία Μη Γραµµικών πρακτόρων
Vasileiou, G. (2023) · DSpace - NTUA (National Technical University of Athens) · doi:10.26240/heal.ntua.24688
Distribuirana kalibracija senzorskih mreža u velikim sistemima upravljanja zasnovana na konsenzusu
Stanković, M. (2023) · National Repository of Dissertations in Serbia
Distributed Averaging Dynamics and Optimization over Random Networks
Aghajan Abdollah, A. (2021) · eScholarship (California Digital Library)
On Gossip Algorithms for Machine Learning with Pairwise ObjectivesPreprint
Colin, I., Bellet, A., Clémençon, S., & Salmon, J. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2603.24128
“…0 such that for any t ≥ T 1 , any k ∈ [ n ] and any q > 0 , )) t ≥ 1 is a Bernoulli process of parameter 1 /p k , by the law of iterative logarithms Dudley (2010), (Nedić, 2011, Lemma 3) one has with probability 1 and for any q > 0 , lim t → + ∞ | m k ( t ) − t | t 12+ q = 0, and the result holds.”
Adapting machine learning methods to U-statistics
Colin, I. (2016) · theses.fr (ABES) · doi:10.70675/e0971642z7cdfz4d3azb883z3f2c64fc1a70
“…de l’aggrégation de données sur un réseau de capteur (HEDETNIEMI, HEDETNIEMI, and LIESTMAN, 1988; DIMAKIS, SARWATE, and WAINWRIGHT, 2008; KAR and MOURA, 2009) à l’optimisation décentralisée multi-agent (NEDIĆ, 2011; DUCHI, AGARWAL, and WAINWRIGHT, 2012; TSIANOS, LAWLOR, and RABBAT, 2015).”
BackgroundUnified Communication Compression Beyond Global Error Bounds for Distributed Nonconvex OptimizationPreprint
Wang, H., Liwang, M., Hong, Y., Johansson, K. H., & Yi, X. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2604.10615
Ran, L., Li, H., Wang, Z., Lü, Q., Li, J., & Zheng, L. (2026) · Journal of Computational and Applied Mathematics · doi:10.1016/j.cam.2026.117835
Communication efficient large scale distributed optimization with curvature acceleration
Li, Y. (2022) · Illinois Digital Environment for Access to Learning and Scholarship (University of Illinois at Urbana-Champaign)
Fang, X., Li, J., Zhang, B., & Yuan, D. (2026) · Journal of the Franklin Institute · doi:10.1016/j.jfranklin.2026.109203
Metadata
- Authors
- Nedic, A.
- Venue
- IEEE Transactions on Automatic Control
- Published
- 2011-06
- Volume
- 56
- Issue
- 6
- Pages
- 1337-1351
- ISSN
- 0018-9286 (ISSN-L)
- 1558-2523
- OpenAlex
- W2130263842
- Cited by
- 310
- References
- 36
- Citations by year
- 2026: 2 · 2025: 14 · 2024: 17 · 2023: 12 · 2022: 10 · 2021: 20 · 2020: 38 · 2019: 36 · 2018: 33 · 2017: 30 · 2016: 21 · 2015: 21 · 2014: 21 · 2013: 15 · 2012: 14
- FWCI
- 15.51
- 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 › Artificial Intelligence › Stochastic Gradient Optimization Techniques
- Keywords
- distributed convex optimization, multi-agent systems, random link failures, constant step size, almost sure convergence, error bounds, distributed 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
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.