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 201–300 of 326
Zhang, S., Pananjady, A., & Romberg, J. (2025) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2025.3562997 · Cited by 6
“The distributed gradient ( DG ) method was proposed in [11] for the general network topology, and was further extended in [12] and [13].”
Asynchronous broadcast‐based event‐triggered control for discrete‐time clock synchronization
Jia, Z., Dai, X., Cui, D., & Hu, Y. (2023) · IET Control Theory and Applications · doi:10.1049/cth2.12488 · Cited by 6
Distributed stochastic optimization under imperfect information
Kannan, A., Nedić, A., & Shanbhag, U. V. (2015) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2015.7402233 · Cited by 6
“In recent work [19], the authors consider a settin g of asynchronous gossip-protocol, while stochastic extens ions to asynchronous optimization were considered in [20], [21] , [22], [23], convergent distributed schemes were proposed, and error bounds for finite termination were obtained.”
BackgroundGossip-based gradient-free method for multi-agent optimization: Constant step size analysis
Yuan, D. (2014) · Chinese Control Conference (CCC) · doi:10.1109/chicc.2014.6896825 · Cited by 6
Stanković, M. (2018) · IET Control Theory and Applications · doi:10.1049/iet-cta.2018.5417 · Cited by 6
Augmented distributed optimization for networked systems
Xu, J. (2019) · doi:10.32657/10356/68805 · Cited by 5
Distributed drift estimation for time synchronization in lossy networks
Stanković, M. S., Stanković, S. S., & Johansson, K. H. (2016) · Mediterranean Conference on Control and Automation (MED) · doi:10.1109/med.2016.7535942 · Cited by 5
“Lemma 1: [18] Let (A1) and (A3) be satisfied, let pi be the unconditional probability of node i to update its parameters, i = 1, .”
BackgroundDistributed nonlinear programming methods for optimization problems with inequality constraints
Matei, I., & Baras, J. S. (2015) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2015.7402615 · Cited by 5
“[15], [18] include communication noise and errors on subgradients, [10], [12] assume a random communication graph, [15], [20] study asynchronous versions of the algorithm, [11] considers state-dependent communication topologies, while [3] assumes directed communication graphs.”
BackgroundDistributed non‐linear robust consensus‐based sensor calibration for networked control systems
Stanković, M., & Antić, D. (2020) · IET Control Theory and Applications · doi:10.1049/iet-cta.2019.0672 · Cited by 5
“…been found that the superiority of the robust algorithms is in this case somewhat lower, probably due to the fact that the application of instrumental variables in the gain estimation algorithm causes an increase of the estimation error covariance w.r.t. the basic gradient schemes [14–16, 35, 41].”
BackgroundFeng, H., Shi, X., Yang, T., & Hu, B. (2013) · Signal Processing · doi:10.1016/j.sigpro.2013.11.017 · Cited by 5
Broadcast Gossip Algorithm for Nash Equilibrium Seeking of Nonaggregative Games
Wang, D., Wu, F., Xu, X., Wen, C., Lian, J., & Zhou, J. (2023) · IEEE Transactions on Artificial Intelligence · doi:10.1109/tai.2023.3326113 · Cited by 5
“Gossip-basedalgorithmsareoftenemployedinconsensusand optimizationproblemsformultiagentsystems[18],[19],[20], [21]andNashequilibriumseekinginanetworkedgame[22], [23],[24].”
BackgroundMulti-Agent asynchronous nonconvex large-scale optimization
Cannelli, L., Facchinei, F., & Scutari, G. (2017) · IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing · doi:10.1109/camsap.2017.8313161 · Cited by 5
Approximate projections for decentralized optimization with SDP constraints
Lee, S., & Zavlanos, M. M. (2016) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2016.7798403 · Cited by 5
Decentralized Coordination Control for Dynamic Multiagent Systems
Kvaternik, K. (2015) · TSpace (University of Toronto) · Cited by 5
DC-DistADMM: ADMM Algorithm for Contsrained Distributed Optimization over Directed GraphsPreprint
Khatana, V., & Salapaka, M. V. (2020) · arXiv (Cornell University) · Cited by 5
Computing Equilibria in Stochastic Nonconvex and Non-monotone Games via Gradient-Response SchemesPreprint
Xiao, Z., & Shanbhag, U. V. (2025) · arXiv (Cornell University) · doi:10.48550/arxiv.2504.14056 · Cited by 5
“Naturally, deterministic stepsizes are harder to prescribe, leading to random stepsizes used in SAGR as presented in [23, 33].”
Distributed convex stochastic optimization under few constraints in large networks
Couillet, R., Bianchi, P., & Jakubowicz, J. (2011) · IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing · doi:10.1109/camsap.2011.6136006 · Cited by 4
“Instead, [7], [3] weaken the double-stochasticity assumption and analyze the broadcast method.”
MethodRan, L., Li, H., Zheng, L., & Li, J. Q. (2024) · IEEE Transactions on Emerging Topics in Computational Intelligence · doi:10.1109/tetci.2024.3437249 · Cited by 4
“Remark 2: In Algorithm 2, each agent’s activation process is assumed to follow a Poisson process that is independently and identically distributed [28], [51], [52].”
InfluentialRow-Stochastic Matrices Based Distributed Optimization Algorithm With Uncoordinated Step-Sizes
Li, H., Wang, J., & Wang, Z. (2019) · International Conference on Information, Cybernetics, and Computational Social Systems (ICCSS) · doi:10.1109/iccss48103.2019.9115478 · Cited by 4
“To make up for the deficiencies of the above methods [9], [13], [16], Shi et al. in [17] employed a coordinated step-size and modified the update of the standard gradient algorithm such that the algorithm linearly converged to the global optimization solution.”
MethodGradient‐free algorithms for distributed online convex optimization
Liu, Y., Zhao, W., & Dong, D. (2022) · Asian Journal of Control · doi:10.1002/asjc.2996 · Cited by 4
A Totally Asynchronous Algorithm for Time-Varying Convex Optimization Problems
Behrendt, G., & Hale, M. (2023) · IFAC-PapersOnLine · doi:10.1016/j.ifacol.2023.10.116 · Cited by 4
Optimization over networks: Efficient algorithms and analysis
Lee, S. (2013) · Illinois Digital Environment for Access to Learning and Scholarship (University of Illinois at Urbana-Champaign) · Cited by 4
Gossip-based random projection algorithm for distributed optimization: Error bound
Lee, S., & Nedić, A. (2013) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2013.6760978 · Cited by 4
Gossip‐based distributed hierarchical algorithm for multi‐cluster constrained optimisation
Li, D., Shi, C., & Yang, G. (2019) · IET Control Theory and Applications · doi:10.1049/iet-cta.2018.6224 · Cited by 4
Distributed Optimization for Client-Server Architecture with Negative Gradient WeightsPreprint
Gade, S., & Vaidya, N. H. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1608.03866 · Cited by 4
“Several solutions to distributed optimization of convex functions are proposed for myriad scenarios involving directed graphs [7], link failures and losses [8], asynchronous communication models [9, 10, 11], stochastic functions [4, 12, 13], fault tolerance [14, 15] and differential privacy [16].”
BackgroundDistributed Convex Optimization With Coupling Constraints Over Time-Varying Directed GraphsPreprint
Gu, C., Wu, Z., Li, J., & Guo, Y. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1805.07916 · Cited by 5
“11, 13, 12, 29, 30] In [11], Nedic´ et al. firstly proposed a distributed subgradient algorithm with provable convergence rates,whileitsstochasticvariantwasinvestigatedin[26]anditsasynchronousvariantin[27]. Based on dual averaging methods, Duchi et al. [13] proposed a distributed dual averaging algorithm and obtained t…”
BackgroundBehrendt, G., & Hale, M. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2110.06705 · Cited by 4
Distributed Asynchronous Optimization With Inseparable Coupled Constraints and Its Application
Wang, T., Liu, W., Li, Z., Ye, Z., Peng, X., & Du, W. (2025) · IEEE Transactions on Automation Science and Engineering · doi:10.1109/tase.2025.3550740 · Cited by 3
“Nedic pointed out a distributed asynchronous subgradient algorithm to deal with the node communication link failure in the earliest in [27].”
Deng, S., Han, Z., Lü, Q., Li, Y., Li, H., & Xia, D. (2025) · Journal of the Franklin Institute · doi:10.1016/j.jfranklin.2025.108107 · Cited by 3
Shi, Z., & Zhou, C. (2020) · Optimal Control Applications and Methods · doi:10.1002/oca.2643 · Cited by 3
A Communication-Efficient Local Differentially Private Algorithm in Federated Optimization
Alam, S. E., Shukla, D., & Rao, S. (2023) · IEEE Access · doi:10.1109/access.2023.3283503 · Cited by 3
“Broadcast-based approach [65], [66], to name a few.”
BackgroundAsynchronous Distributed Model Predictive Control for Multi-Agent Systems
Mi, X., Liao, Y., & Zeng, H. (2025) · IEEE Access · doi:10.1109/access.2025.3525487 · Cited by 3
Gradient-free distributed online optimization in networks
Liu, Y., Zhao, W., Zhang, N., Lv, D., & Zhang, S. (2025) · Control Theory and Technology · doi:10.1007/s11768-025-00242-0 · Cited by 3
Linear Convergence of Asynchronous Gradient Push Algorithm for Distributed Optimization
Li, H., Cheng, H., Lü, Q., Wang, Z., & Huang, T. (2024) · IEEE Transactions on Systems Man and Cybernetics Systems · doi:10.1109/tsmc.2024.3516936 · Cited by 3
Li, W., Assaad, M., & Zheng, S. (2021) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2021.3077516 · Cited by 3
Zhou, Y., Ai, W., Tang, G., & Chen, H. (2023) · Applied Intelligence · doi:10.1007/s10489-023-04765-4 · Cited by 3
Xiao, L., Bao, J., & Shi, X. (2016) · Applied and Computational Mathematics · doi:10.11648/j.acm.20160505.15 · Cited by 3
“Moreover, distributed optimization problems with asynchronous step-Applied sizes or inequality-equality constraints or using other algorithms were studied in [7]-[12] and corresponding conditions were given to ensure the system converge to the optimal point or its neighborhood.”
BackgroundMethodFast Decentralized Data Analytics in IoT Wireless Networks
Zhao, L. (2019) · IEEE Access · doi:10.1109/access.2019.2960494 · Cited by 3
“Lemma 3 [33]: The upperbounds of step size αi,k are obtained as follows when k is large enough (k > k̃(m, q))”
BackgroundMethodInfluentialAsynchronous Stochastic Gradient Descent over Decentralized Datasets
Du, Y., You, K., & Mo, Y. (2020) · International Conference on Control and Automation · doi:10.1109/icca51439.2020.9264316 · Cited by 3
“The assumption that running process of each worker is an independent stationary poisson process is not rarely seen in previous works on distributed optimization [15]–[18].”
BackgroundNash Equilibrium Seeking Over Networks
Salehisadaghiani, F. (2017) · TSpace (University of Toronto) · Cited by 3
Distributed ADMM over directed graphs.Preprint
Rokade, K., & Kalaimani, R. K. (2020) · arXiv (Cornell University) · Cited by 3
Multi-resource allocation for federated settings: A non-homogeneous Markov chain modelPreprint
Alam, S. E., Wirth, F. R., & Yu, J. Y. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2104.12828 · Cited by 3
“…are proposed, such as sub-gradient methods [36], [27], dual averaging [18], alternating direction method of multipliers (ADMM) [11], broadcast-based approaches [35]—asynchronous communication be-tween agents is considered, and the failure of a link does not affect the solution, to name a few.”
BackgroundAccuracy-aware privacy mechanisms for distributed computation
Gade, S. (2020) · Illinois Digital Environment for Access to Learning and Scholarship (University of Illinois at Urbana-Champaign) · Cited by 3
Nedić, A. (2021) · Springer eBooks · doi:10.1007/978-3-030-44184-5_219 · Cited by 3
Securing intelligent networks: federated learning approaches for privacy-conscious anomaly detection
Manzoor, H. U. (2025) · Enlighten: Theses (The University of Glasgow) · doi:10.5525/gla.thesis.85412 · Cited by 3
Asynchronous Algorithm for Distributed Multi-agent Convex Optimization
Zhao, D., Liu, D., & Zhang, X. (2020) · Chinese Control Conference (CCC) · doi:10.23919/ccc50068.2020.9189317 · Cited by 2
“In [12], Nedic proposes an asynchronous distributed convex algorithm over multi-agent network by applying the broadcast-based technology.”
BackgroundLiu, B., Du, W., & Li, Z. (2025) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2025.3539580 · Cited by 2
“Thisissimilartousingdifferentstep-sizesinanaveragesense, especially concerning random or undirected networks [31], [32].”
On Distributed Optimization Over Random Independent Networks
Aghajan, A., & Touri, B. (2022) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.23919/acc53348.2022.9867471 · Cited by 2
“Fully Distributed Averaging-Based Solvers over Time-Varying Networks : Gossip algorithms, which were originally studied in [2], [4], have been used in solving distributed optimization problems [10], [14].”
BackgroundMethodA Cooperative Optimization Algorithm Inspired by Chaos–Order Transition
Ge, F., Hong, L., Wu, Q., & Shi, L. M. (2015) · Mathematical Problems in Engineering · doi:10.1155/2015/984047 · Cited by 2
“Srivastava and Nedi´c [13, 14] devise a distributed optimization algorithm with asynchronous communication.”
BackgroundA Flexible Distributed Optimization Framework for Service of Concurrent Tasks in Processing Networks
Shi, Z., & Eryılmaz, A. (2019) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infocom.2019.8737632 · Cited by 2
“We also provide convergence rates of our algorithms for several classes of functions, which are not presented in [11].”
BackgroundMethodInfluentialA randomized incremental primal-dual method for decentralized consensus optimization
Chen, C., Chen, Y., & Ye, X. (2019) · Analysis and Applications · doi:10.1142/s0219530519410082 · Cited by 2
Lü, B., Zhongwei, Z., Zhang, Z., Yu, Y. J., & Liu, T. (2021) · Engineering Applications of Artificial Intelligence · doi:10.1016/j.engappai.2020.104115 · Cited by 2
Zhao, D., Liu, D., & Liu, L. (2022) · IET Control Theory and Applications · doi:10.1049/cth2.12351 · Cited by 2
Distributed algorithms for networked multi-agent systems: Optimization and competition
Koshal, J. (2012) · Illinois Digital Environment for Access to Learning and Scholarship (University of Illinois at Urbana-Champaign) · Cited by 2
Yuan, Y., & Xie, X. (2018) · Chinese Control Conference (CCC) · doi:10.23919/chicc.2018.8483382 · Cited by 2
“Letting ε̄ = maxk εk, τ = min1≤i≤m{γiαi}, τ̄ = max1≤i≤m{γiαi}, ᾱ = max1≤i≤m αi, and using[5] |fi(ȳk−1)− fi(x∗)| ≤ C‖ȳk−1 − x∗‖ ≤ CDX”
BackgroundMethodInfluentialDistributed Offset Correction for Time Synchronization in Networks with Random Delays
Stanković, M. S., Stanković, S. S., & Johansson, K. H. (2018) · European Control Conference (ECC) · doi:10.23919/ecc.2018.8550365 · Cited by 2
“Following [15], [24], we replace the variable tjl by the corresponding index k in all the above defined functions of time, τj(t j l ) = τj(k), τ̄j(t j l ) = τ̄j(k), ξj(t j l ) = ξj(k), etc.”
A New Multi-Objective Unit Commitment Model Solved by Decomposition-Coordination
Zhai, S., Wang, Z., Cao, J. L., & He, G. (2019) · Applied Sciences · doi:10.3390/app9050829 · Cited by 2
“In [27], a two level decomposition framework is presented, the lower level solve the local problem to optimize the local cost, while the upper level use the coordinators obtained in lower level to update the prices by subgradient method [28].”
MethodConsensus-Based Value Iteration for Multiagent Cooperative Control
Wang, J., Wilson, E., & Velasquez, A. (2021) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc45484.2021.9682831 · Cited by 2
“More general cases of constrained optimization were studied over random networks [21] [14] instead of using an asynchronous broadcast-based method [19] and using a distributed gossip algorithm [15].”
MethodDecentralized Topic Modelling with Latent Dirichlet AllocationPreprint
Colin, I., & Dupuy, C. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1610.01417 · Cited by 2
“We propose a method to adapt latent Dirichlet allocation (LDA) model to decentralized optimization and show on synthetic data that we still recover similar parameters and similar performance at each node than with stochastic methods accessing to the whole information in the graph.”
MethodTowards Real-Time Distributed Planning in Multi-Robot Systems
Abdelkader, M. (2018) · King Abdullah University of Science and Technology Repository (King Abdullah University of Science and Technology) · doi:10.25781/kaust-2sbxl · Cited by 2
“Dynamic sub-gradient + consensus steps [36],[37] sub-gradient + consensus steps [38] Global set Static projected sub-gradient + consensus steps [28], [39] dual decomposition [40] Local sets Static projected sub-gradient + consensus steps [29] augmented Lagrangian method [32]”
BackgroundAsynchronous subgradient push: fast, robust, and scalable multi-agent optimization
Assran, M. (2018) · doi:10.82308/55133 · Cited by 2
Fang, X., Zhang, B., Yuan, D., Liu, H., & Song, B. (2025) · Systems & Control Letters · doi:10.1016/j.sysconle.2025.106159 · Cited by 1
Byzantine-Resilient Multiagent Distributed Optimization Under Redundancy
Zhai, Y., Liu, Z., Yue, D., Hu, S., Deng, C., & Ye, L. (2025) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2025.3583622 · Cited by 1
“Furthermore, they analyze the convergence of the gradient-descent method under the condition of constrained states [6], asynchronous communication [7], and time-varying topology [8].”
Privacy-preserving gradient tracking via state decomposition for directed multi-agent optimization
Li, Y., Wu, C., Zhang, K., Lü, Q., Deng, S., & Li, H. (2026) · Communications in Nonlinear Science and Numerical Simulation · doi:10.1016/j.cnsns.2026.110441 · Cited by 1
Asynchronous Gossip-Based Gradient-Free Method for Multiagent Optimization
Yuan, D. (2014) · Abstract and Applied Analysis · doi:10.1155/2014/618641 · Cited by 1
“In [5], the author further removes the need for bidirectional communications of the asynchronous algorithm in [14]; the convergence of the algorithm is also established.”
BackgroundInfluentialDistributed proportional stochastic coordinate descent with social sampling
Ghassemi, M., & Sarwate, A. D. (2015) · Allerton Conference on Communication, Control, and Computing · doi:10.1109/allerton.2015.7446981 · Cited by 1
“Distributed optimization has received significant interest in recent years especially consensus-based algorithms under various assumptions and constraints [4]– [8].”
BackgroundAsynchronous Algorithms for Computing Equilibrium Prices in a Capital Asset Pricing Model
Tong, J., Hu, J.-Q., & You, J. (2019) · Asia Pacific Journal of Operational Research · doi:10.1142/s0217595919500234 · Cited by 1
Li, H., Lü, Q., Wang, Z., Liao, X., & Huang, T. (2020) · Springer eBooks · doi:10.1007/978-981-15-6109-2_3 · Cited by 1
Zhu, J., Xie, P., Wu, Q., Zhang, M., Zheng, R., Guan, J., & Xu, C. (2017) · Mathematical Problems in Engineering · doi:10.1155/2017/1793291 · Cited by 1
“Thus, according to Lemma 3 of [26], there exists a sufficient large positive constant ?̂?, for any t ≥ ?̂?, we have 2αi (t) (φi (yi (t)) − φi (u)) ≥ 2 tγi (φi (yi (t)) − φi (u)) − 2 2 t3/2−qp2 min Lmax yi (t) − u ≥ 2 tγi (φi (yi (t)) − φi (u)) − 2 t3/2−qp2 min (L2max + yi (t) − u2) , (18)”
BackgroundMethodInfluentialCommunication-Efficient Decentralized Cooperative Data Analytics in Sensor Networks
Zhao, L., Li, Z., & Guo, S. (2018) · Lecture notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering · doi:10.1007/978-3-030-00557-3_66 · Cited by 1
“Nedic [12] first filled this gap by considering general decentralized convex optimization under the asynchronous broadcast setting.”
BackgroundLi, H., Lü, Q., Wang, Z., Liao, X., & Huang, T. (2020) · Springer eBooks · doi:10.1007/978-981-15-6109-2_2 · Cited by 1
Asynchronous Broadcast-Based Distributed Optimization over Unbalanced Directed Networks
Li, H., Lü, Q., Wang, Z., Liao, X., & Huang, T. (2020) · Springer eBooks · doi:10.1007/978-981-15-6109-2_4 · Cited by 1
Random Sleep Scheme-Based Distributed Optimization over Time-Varying Directed Networks
Li, H., Lü, Q., Wang, Z., Liao, X., & Huang, T. (2020) · Springer eBooks · doi:10.1007/978-981-15-6109-2_7 · Cited by 1
Asynchronous Bayesian Learning over a Network
Bhar, K., Bai, H., George, J., & Busart, C. (2022) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc51059.2022.9992353 · Cited by 1
ELM-Based Distributed Cooperative Learning Over NetworksPreprint
Ai, W., & Chen, W. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1504.00981 · Cited by 1
“Simultaneously, each agent communicates with its neighbors in order to achieve an agreement on the estimate of the optimizer [29], [42], [43].”
BackgroundDistributed Multi-resource Allocation with Little Communication OverheadPreprint
Alam, S. E., Shorten, R. N., Wirth, F. R., & Yu, J. Y. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1711.01977 · Cited by 1
“While this body of work is too numerous to enumerate, we point the interested readers to the works of Nedic [20, 19]; Cortes [16]; Jadbabaie and Morse[14]; Bullo [21]; Pappas [13], Bersetkas [3]; Tsitsiklis [4] for recent contributions.”
BackgroundCommunication-Efficient Projection-Free Algorithm for Distributed OptimizationPreprint
Li, Y., Qu, C., & Xu, H. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1805.07841 · Cited by 1
“For non-smooth objective functions, consensus-based subgradient methods have been analyzed in Nedic and Ozdaglar (2009); Sundhar Ram et al. (2010); Nedic (2011).”
MethodInfluentialDehghanpour, K. (2017) · Montana State University ScholarWorks (Montana State University) · Cited by 1
How to Organize your Deep Reinforcement Learning Agents: The Importance of Communication TopologyPreprint
Adjodah, D., Calacci, D., Dubey, A., Krafft, P. M., Moro, E., & Pentland, A. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1811.12556 · Cited by 1
“There is significant evidence that the network structure of communication between nodes signifi-cantly affects the convergence rate and accuracy of learning from the literatures of decentralized optimization [16, 17, 15].”
BackgroundFirst-order Methods with Convergence Rates for Multi-agent Systems on Semidefinite Matrix SpacesPreprint
Majlesinasab, N., Yousefian, F., & Feizollahi, M. J. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1902.05900 · Cited by 1
“Decentralized optimization problems have a wide range of applications arising in data mining and machine learning (Nedić et al. (2017)), wireless sensor networks (Durham et al.”
BackgroundGraph Balancing for Distributed Subgradient Methods over Directed GraphsPreprint
Makhdoumi, A., & Ozdaglar, A. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1603.03461 · Cited by 1
“Undirected Graphs: A number of recent papers proposed subgradient type distributed methods that use consensus or averaging mechanisms for aggregating information among the agents over an undirected network (see [26], [27], [20], [35], [15], [41], [22], [23], [48], [2], [8]).”
BackgroundGradient-Consensus Method for Distributed Optimization in Directed NetworksPreprint
Khatana, V., Saraswat, G., Patel, S., & Salapaka, M. V. (2019) · arXiv (Cornell University) · Cited by 1
Byzantine-Resilient Multi-Agent Distributed Exact Optimization with Less DataPreprint
Zhai, Y., Liu, Z., Yue, D., Hu, S., & Xie, X. (2023) · arXiv (Cornell University) · doi:10.48550/arxiv.2302.14570 · Cited by 1
“Furthermore, they analyze the convergence of the gradient-descent method in the condition of constrained states [5], asynchronous communication [6] and time-varying topology [7].”
MethodGarcía, A., Wang, B., & Pu, S. (2023) · Springer eBooks · doi:10.1007/978-3-030-54621-2_809-1 · Cited by 1
Heterogeneous Distributed Zeroth-Order Nonconvex Optimization with Communication CompressionPreprint
Wang, H., Yi, X., Hong, Y., & Liwang, M. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2602.08659 · Cited by 1
“This has motivated extensive studies on communication-efficient designs, such as compression [21], event-triggered communication [22], and asynchronous schemes [23].”
Problem-aware scheduling of in-network computation over multi-hop wireless networks
Meshram, R. H., Borkar, V. S., & Manjunath, D. (2012) · International Conference on Signal Processing and Communications (SPCOM) · doi:10.1109/spcom.2012.6290215
A non-consensus based distributed optimization algorithm
Matei, I., & Baras, J. S. (2013) · University Libraries (University of Maryland)
A Consensus Approach to Distributed Convex Optimization in Multi-Agent Systems
Zanella, F. (2013) · Padua@research (University of Padova)
New Path Following Algorithm for Convex Programming
Fan, X., & Gong, D. (2013) · Communications in computer and information science · doi:10.1007/978-3-642-53703-5_53
Average-consensus in a two-time-scale Markov system
Topley, K. (2014) · cIRcle (University of British Columbia) · doi:10.14288/1.0165567
In-situ Data Analytics In Cyber-Physical Systems
Zhao, L. (2016) · Digital Archive @ GSU · doi:10.57709/8501627
Joint event detection and environment perception in decentralised wireless sensor networks
Zhu, J., Xue, M., Li, Y., & Ling, Q. H. (2016) · International Journal of Sensor Networks · doi:10.1504/ijsnet.2016.078323
Distributed optimization on a wireless sensor network testbed
Venkatesan, N. (2015) · Illinois Digital Environment for Access to Learning and Scholarship (University of Illinois at Urbana-Champaign)
From coordinate descent to social sampling
Ghassemi, M. (2016) · doi:10.7282/t3m90btp
“4 Asynchronous Broadcast-Based Distributed Optimization This asynchronous method [13] also builds on the works by Nedić and Ozdaglar [12] and Tsitsiklis et al.”
MethodCoordinate Update Algorithms: Theory and Applications
Wu, T. (2017) · eScholarship (California Digital Library)
Asynchronous resource allocation in distributed heterogeneous networks
Bedi, A. S., & Rajawat, K. (2017) · International Conference on Communications · doi:10.1109/icc.2017.7997329
Asynchronous Subgradient-push Algorithm for Distributed optimization over Directed Graphs
Zhang, J., & You, K. (2019) · Chinese Control Conference (CCC) · doi:10.23919/chicc.2019.8866497
“For example, The algorithms in [8–10] require all nodes to be randomly activated and update with the same probability, which clearly results in EUR.”
MethodDistributed Asynchronous Random Projection Algorithm (DARPA) with Arbitrary Uniformly Bounded Delay
Atallah, E., Rahnavard, N., & Enyioha, C. (2019) · Allerton Conference on Communication, Control, and Computing · doi:10.1109/allerton.2019.8919755
“Using Lemma 3 in [7] we get that for pmin = mini,j∈E(k) pij where pij > 0 is the probability that the edge {i, j} is functioning.”
InfluentialOperator Sliding and Decentralized Optimization
Lan, G. (2020) · Springer series in the data sciences · doi:10.1007/978-3-030-39568-1_8
Distributed Economic Dispatch in Smart Grids: Event-Triggered Scheme
Li, H., Lü, Q., Wang, Z., Liao, X., & Huang, T. (2020) · Springer eBooks · doi:10.1007/978-981-15-6109-2_10
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.