Distributed Subgradient Methods for Convex Optimization Over Random Networks
The DOI matches its Crossref record; 28 of the 28 references it cites were found in a registry or an index.
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
Items 201–300 of 342
On the Convergence Properties of a Distributed Projected Subgradient Algorithm
Li, W., Chen, Z., Lou, Y., & Hong, Y. (2023) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2023.3284599 · Cited by 9
“In [16], the authors considered the weight matrices A ( k ) drawn independently from a probability space, and explored convergence properties of a distributed subgradient algorithm.”
BackgroundMethodDIMIX: Diminishing Mixing for Sloppy Agents
Reisizadeh, H., Touri, B., & Mohajer, S. (2023) · SIAM Journal on Optimization · doi:10.1137/21m143546x · Cited by 10
Primal-Dual Distributed Temporal Difference LearningPreprint
Lee, D., & Hu, J. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1805.07918 · Cited by 9
“Consider the corresponding graph (E,V), which we refer to as the mean connectivity graph [29].”
BackgroundMethodMechanism Design for Network Utility Maximization with Private Constraint Information
Zhang, M., & Huang, J. (2019) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infocom.2019.8737448 · Cited by 8
“those inspired by [30] and [31]) to compute the GNE.”
MethodYang, H.-R., & Ni, W. (2022) · Machine Intelligence Research · doi:10.1007/s11633-022-1319-2 · Cited by 9
Liu, J., Liao, X., Dong, J.-S., & Mansoori, A. (2023) · Neural Networks · doi:10.1016/j.neunet.2023.02.011 · Cited by 8
Distributed Random-Fixed Projected Algorithm for Constrained Optimization Over Digraphs
Xie, P., You, K., Song, S., & Wu, C. (2017) · IFAC-PapersOnLine · doi:10.1016/j.ifacol.2017.08.2284 · Cited by 9
An extension of the method of multipliers for distributed nonlinear programming
Matei, I., Baras, J. S., Nabi, M., & Kurtoglu, T. (2014) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2014.7040481 · Cited by 8
“[14], [17] include communication noise and errors on subgradients, [10], [12] assume a random communication graph, [14], [19] study asynchronous versions of the algorithm, [11] considers state-”
BackgroundCooperative optimisation with inseparable cost functions
Li, T., Lin, H., & Zhao, J. Y. (2015) · IET Control Theory and Applications · doi:10.1049/iet-cta.2014.1161 · Cited by 7
Distributed load management algorithms in anycast-based CDNs
Sinha, A., Mani, P., Liu, J., Flavel, A., & Maltz, D. (2017) · Computer Networks · doi:10.1016/j.comnet.2017.01.016 · Cited by 7
“The Dual Decomposition Algorithm In this section, we derive a dual algorithm [18], [27], [28] for the problem P1 and show how it leads to a distributed implementation with negligible control overhead.”
MethodDistributed multi-agent convex optimization over random digraphs
Alaviani, S. S., & Elia, N. (2017) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.23919/acc.2017.7963776 · Cited by 9
“Note that [24] and [25] have also investigated the convergence of their algorithms with constant step sizes to a neighborhood of the optimal solution.”
BackgroundInfluentialLi, J., Gu, C., Wu, Z., & Wu, C. (2017) · Complexity · doi:10.1155/2017/3610283 · Cited by 7
Distributed optimization on random graphs
Rezaeinia, P., Gharesifard, B., Linder, T., & Touri, B. (2018) · IFAC-PapersOnLine · doi:10.1016/j.ifacol.2018.12.067 · Cited by 7
Decentralized Constrained Optimization: Double Averaging and Gradient Projection
Shahriari-Mehr, F., Bosch, D. D., & Panahi, A. (2021) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc45484.2021.9683355 · Cited by 8
“First, the decentralized gradient decent methods including [15, 21] use diminishing step size for convergence to the exact solution of the problem.”
MethodOnline Distributed ADMM on NetworksPreprint
Hosseini, S., Chapman, A., & Mesbahi, M. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1412.7116 · Cited by 7
“MAIN RESULT The main contribution of this paper is extending O-ADMM [8] via Nesterov’s Dual Averaging (DA) algorithm [29] and distributed subgradients (descent) method discussed in [13], [30], [31], [32], to provide a distributed decision-making process for the optimization problem discussed in §III with a sub-linear…”
MethodOptimal Statistical Rates for Decentralised Non-Parametric Regression with Linear Speed-Up
Richards, D., & Rebeschini, P. (2019) · neural information processing systems · doi:10.48550/arxiv.1905.03135 · Cited by 14
“Since the early works [52, 53] to the more recent work [22, 34, 33, 23, 29, 30, 10, 18, 47, 31], problems in decentralised multi-agent optimisation have often been treated as a particular instance of consensus optimisation.”
BackgroundGradient-Consensus: Linearly Convergent Distributed Optimization Algorithm over Directed GraphsPreprint
Khatana, V., Saraswat, G., Patel, S., & Salapaka, M. V. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1909.10070 · Cited by 7
Rate of Convergence for Distributed Optimization with Uncertain CommunicationsPreprint
Rezaeinia, P., & Gharesifard, B. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2003.10342 · Cited by 7
“As shown in for example [10], 7”
Consensus based constrained optimization for multi-agent systems
Liu, S., Xie, L., & Liu, C. (2015) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2015.7403073 · Cited by 6
“The problem was revisited under random communication graphs in [16].”
BackgroundMUSIC: Accelerated Convergence for Distributed Optimization With Inexact and Exact Methods
Wu, M., Liao, H., Ding, Z., & Xiao, Y. (2024) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2024.3376421 · Cited by 8
“Many previous studies [3], [20], [44], [47] have clearly shown that the disagreement between estimates across all agents generated by the combination (consensus) step (3) or (6) goes almost surely to zero, that is, lim t →∞ ∥ x tj − x ti 0 with probability 1 when the network connectivity, doubly…”
Energy-saving gossip algorithm for compressed sensing in multi-agent systems
Ravazzi, C., Fosson, S. M., & Magli, E. (2014) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp.2014.6854566 · Cited by 6
“The most well known are the distributed subgradient algorithms (DSM [8–10]), the alternating direction method of multipliers (D-ADMM [4, 11, 12]), This work is supported by the European Research Council under the European Community’s Seventh Framework Programme (FP7/2007-2013) / ERC Grant agreement n.279848. and the d…”
MethodDistributed optimization with applications to sensor networks and machine learning
Srivastava, K. (2011) · Illinois Digital Environment for Access to Learning and Scholarship (University of Illinois at Urbana-Champaign) · Cited by 11
Distributed Optimization Over Weight-Balanced Digraphs with Event-Triggered Communication
Pan, X., Liu, Z., & Chen, Z. (2016) · Lecture notes in electrical engineering · doi:10.1007/978-981-10-2335-4_45 · Cited by 6
Convergence of Distributed Gradient-Tracking-Based Optimization Algorithms with Random Graphs
Wang, J., Fu, K., Gu, Y., & Li, T. (2021) · Journal of Systems Science and Complexity · doi:10.1007/s11424-021-9355-5 · Cited by 6
Nonlinear Programming Methods for Distributed OptimizationPreprint
Matei, I., & Baras, J. S. (2015) · arXiv (Cornell University) · doi:10.13016/m2ng71 · Cited by 7
“time varying random combination of sub-gradient and consensus steps [12], [14] state dependent combination of sub-gradient and consensus steps [13]”
BackgroundStochastic Primal-Dual Algorithm for Distributed Gradient Temporal Difference LearningPreprint
Lee, D., Yoon, H., & Hovakimyan, N. (2018) · arXiv (Cornell University) · Cited by 6
Augmented distributed optimization for networked systems
Xu, J. (2019) · doi:10.32657/10356/68805 · Cited by 5
Distributed Optimization Under Information Constraints: A Survey
Liu, S., Hua, Y., Han, Q., & Xie, L. (2026) · IEEE Transactions on Industrial Informatics · doi:10.1109/tii.2025.3645932 · Cited by 7
“Underthe assumptionthatthegraphisconnectedinexpectation(orjointly connectedoverboundedintervals),DGDwithdiminishingstep sizesconvergesalmostsurelytotheglobaloptimum[16].”
InfluentialDistributed subgradient methods for Delay Tolerant Networks
Masiero, R., & Neglia, G. (2011) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infcom.2011.5935089 · Cited by 5
“the basic framework proposed in [1], [2], while motivated in this paper by the DTN scenario, are of wide interest for other possible applications such as mobile wireless ad-hoc and sensor networks.”
BackgroundMethodInfluentialDistributed 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.”
BackgroundA colored Gauss-Seidel approach for the distributed network flow problem
Maffei, A., Iannelli, L., & Glielmo, L. (2015) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2015.7402990 · Cited by 5
“Subgradient methods are also proposed in [10], [11] where averaging algorithms for locally sharing information over the network are used.”
MethodGradConsensus: Linearly Convergent Algorithm for Reducing Disagreement in Multi-Agent Optimization
Khatana, V., Saraswat, G., Patel, S., & Salapaka, M. V. (2023) · IEEE Transactions on Network Science and Engineering · doi:10.1109/tnse.2023.3321757 · Cited by 7
“However, most existing works including, [1], [2], [3], [4], [5], [6], [7], [8], [9], [10], [11], impose restrictive conditions such as the requirement of doubly-stochastic weight matrices and need of balanced undirected graphs.”
Distributed Multi-Objective Optimization over Randomly Varying Unbalanced Networks
Wada, T., Masubuchi, I., Hanada, K., Asai, T., & Fujisaki, Y. (2017) · IFAC-PapersOnLine · doi:10.1016/j.ifacol.2017.08.434 · Cited by 8
A Review of Adversarial Behaviour in Distributed Multi-Agent Optimisation
Fanitabasi, F. (2018) · IEEE/ACM International Conference on Utility and Cloud Computing Companion (UCC Companion) · doi:10.1109/ucc-companion.2018.00034 · Cited by 6
“The robustness of distributed optimisation methods are investigated in reliable communication scenarios [21] and later on, the failure patterns of communication links are assumed to be predictable, and known in advance [13].”
BackgroundUbl, M., & Hale, M. (2019) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc40024.2019.9030251 · Cited by 5
“A representative sample of this work includes [6]–[10], and these algorithms all rely on an underlying averaging-based update law, i.”
BackgroundNetwork Lifetime Maximization in Wireless Sensor Networks with a Path-Constrained Mobile Sink
Huynh, T., & Hwang, W. (2015) · International Journal of Distributed Sensor Networks · doi:10.1155/2015/679093 · Cited by 5
“Theproof is in part borrowed from [30, 31] and is given in Appendix B.”
BackgroundCycle basis distributed ADMM solution for optimal network flow problem over biconnected graphs
Asadi, R., Kia, S. S., & Regan, A. (2016) · Allerton Conference on Communication, Control, and Computing · doi:10.1109/allerton.2016.7852302 · Cited by 4
“Subgradient methods are analyzed for distributed convex optimization [10] and uncertainty of the network structure is considered in [11].”
MethodA Randomized Block Subgradient Approach to Distributed Big Data Optimization
Farina, F., & Notarstefano, G. (2019) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc40024.2019.9030156 · Cited by 4
“In [5], consensus protocols were studied using random row-stochastic matrices, while in [6] a distributed subgradient method over random networks with underlying doubly stochastic matrices has been proposed.”
MethodA distributed gradient algorithm based economic dispatch strategy for virtual power plant
Cao, C., Xie, J., Yue, D., Zhao, J., Xiao, Y., & Wang, L. (2016) · Chinese Control Conference (CCC) · doi:10.1109/chicc.2016.7554598 · Cited by 4
Distributed Optimization of Multiagent Systems in Directed Networks with Time-Varying Delay
Yan, J., & Yu, H. (2017) · Journal of Control Science and Engineering · doi:10.1155/2017/7937916 · Cited by 4
“In both papers [9, 11], discretetime subgradient algorithms are proposed for unconstrained, separable, convex optimization problem and each agent communicates with the other agents over a time-varying network topology.”
BackgroundDistributed Convex Optimization with Limited Communications
Rao, M., Rini, S., & Goldsmith, A. J. (2019) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp.2019.8682453 · Cited by 4
Comparing Decentralized Gradient Descent Approaches and Guarantees
Moothedath, S., & Vaswani, N. (2023) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp49357.2023.10096994 · Cited by 6
“In the last decade, the design of decentralized GD and projected GD algorithms has received a lot of attention [7, 9, 10, 11, 12, 13, 14, 15], starting with the seminal work of Nedi´c et al. [7].”
Accelerating Level-Value Adjustment for the Polyak Stepsize
Liu, A., Bragin, M. A., Chen, X., & Guan, X. (2025) · Journal of Optimization Theory and Applications · doi:10.1007/s10957-025-02750-0 · Cited by 5
“The datasets and the code implementing our approach are available upon request.”
Sahu, A. K., Jakovetić, D., Bajović, D., & Kar, S. (2018) · IEEE Global Conference on Signal and Information Processing · doi:10.1109/globalsip.2018.8646406 · Cited by 4
“In the context of distributed stochastic strongly convex optimization, first order schemes with static networks ( [2, 9]), deterministic time-varying networks [1, 3, 4] and random time-varying networks albeit with access to exact first order information [10, 11] have been considered.”
BackgroundA Distributed Algorithm with Scalar States for Solving Linear Equations
Wang, X., Mou, S., & Anderson, B. D. O. (2018) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2018.8618967 · Cited by 4
Shahriari-Mehr, F., & Panahi, A. (2024) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2024.3520513 · Cited by 4
“Finally, Section V concludes this article.”
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
Distributed load management in anycast-based CDNs
Sinha, A., Mani, P., Liu, J., Flavel, A., & Maltz, D. A. (2015) · Allerton Conference on Communication, Control, and Computing · doi:10.1109/allerton.2015.7446988 · Cited by 3
“In this section we derive a dual algorithm [18], [19], [20] for the problem P1 and show how it leads to a distributed implementation with negligible control overhead.”
BackgroundAnt Colony Optimization for random network
Bannapure, M., & Patil, V. L. (2014) · IEEE Global Conference on Wireless Computing and Networking (GCWCN) · doi:10.1109/gcwcn.2014.7030844 · Cited by 3
Distributed Optimization via Kernelized Multiarmed Bandits
Rai, A., & Mou, S. (2025) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2025.3574032 · Cited by 4
“Here ⊙ denotes the Hadamard (element-wise) product and 1 r denotes a column vector in R r where all its entries are equal to 1 .”
Distributed Optimization Design of Multi-Agent Systems With Packet Losses
Chen, S., Lan, W., Ma, J., & Yu, X. P. (2020) · International Conference on Control and Automation · doi:10.1109/icca51439.2020.9264572 · Cited by 3
Moothedath, S., & Vaswani, N. (2022) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc51059.2022.9992928 · Cited by 3
“In the last decade, the design of decentralized GD and projected GD algorithms has received a lot of attention [10], [11], [19]-[23], starting with the seminal work of Nedić et al.”
BackgroundDistributed Optimization for the DER-Rich Electric Power Grid
Adan, J., & Srivastava, A. K. (2023) · Foundations and Trends® in Electric Energy Systems · doi:10.1561/3100000036 · Cited by 3
On local analysis of distributed optimization
Tatarenko, T., & Touri, B. (2016) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.1109/acc.2016.7526552 · Cited by 3
“We refer the reader to the following papers that consider various settings on network topology, asynchronous updating rules, and noised communication [2], [5], [6], [9].”
BackgroundSample-based Zero-Gradient-Sum distributed consensus optimization of multi-agent systems
Liu, J., & Chen, W. (2014) · World Congress on Intelligent Control and Automation · doi:10.1109/wcica.2014.7052715 · Cited by 4
“Since then, this basic algorithm has been modified and applied to more general DCOPs such as the constrained DCOPs [5]-[8] and the DCOP over more general networks [9]-[10], just to name a few.”
MethodSantilli, M., Marino, A., & Gasparri, A. (2018) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2018.8619315 · Cited by 3
Distributed Gradient Algorithm for Economic Dispatch of Multi-area Power Systems
Shao, S., Gao, F., Wu, J., Liu, R., Yang, Y., & Duan, F. (2019) · IEEE Sustainable Power and Energy Conference (iSPEC) · doi:10.1109/ispec48194.2019.8975026 · Cited by 3
“In [9-11], the objective function This work is supported in part by National Key R&D Project (2016YFB0901900), in part by National Natural Science Foundation (61773309, 61773308, U1766205) of China and in part by the State Grid Science and Technology Program of China.”
MethodA Multi-Scale Method for Distributed Convex Optimization with Constraints
Ni, W., & Wang, X. (2022) · Journal of Optimization Theory and Applications · doi:10.1007/s10957-021-01982-0 · Cited by 4
“The work in [18] also investigated the consensus-based DCO algorithm by using a random graph model where the communication link availability is described by a stochastic process, but leaving challenging issues of optimization constraints and communication noise untouched.”
BackgroundMethodInfluentialDistributed Off-Policy Temporal Difference Learning Using Primal-Dual Method
Lee, D., Kim, D. W., & Hu, J. (2022) · IEEE Access · doi:10.1109/access.2022.3211395 · Cited by 3
“Lemma 2 provides rough estimates of the bounds on the sets that include at least one saddle-point of the Lagrangian function (17).”
BackgroundMethodInfluentialOptimization, control, and game theoretical problems in consensus protocols
Chamie, M. E. (2014) · theses.fr (ABES) · doi:10.70675/d2dd4ab5zaaecz4bc6za36fzc8bbe36b47cf · Cited by 3
Fan, X., Hu, C., Ma, L., & Jiang, H. (2026) · IEEE Systems Man and Cybernetics Magazine · doi:10.1109/msmc.2025.3538995 · Cited by 2
Distributed Optimization With Uncertain Communications
Rezaeinia, P., Gharesifard, B., & Linder, T. (2024) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2024.3495456 · Cited by 2
“As shown in for example [10], 7”
A Distributed Optimization Problem Subject to Partial-Impact Cost Functions
Xia, Z., Liu, Y., Lu, J., Qiu, J., & Cao, J. (2021) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2021.3086183 · Cited by 2
“1) Technical Difficulty: The considered cost functions of [13], [18], [20], and [21] are only with respect to one variable vector x and the obtained methods always involve the usage of the gradient with respect to x .”
BackgroundInfluentialContinuous-Time Multi-agent Network for Distributed Least Absolute Deviation
Liu, Q., Zhao, Y., & Cheng, L. (2015) · Lecture notes in computer science · doi:10.1007/978-3-319-25393-0_48 · 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
A Continuous-Time Multi-Agent Systems Based Algorithm for Constrained Distributed Optimization
Liu, P., Li, H., & Feng, L. (2016) · Applied and Computational Mathematics · doi:10.11648/j.acm.20160503.14 · Cited by 2
“…distributed optimization algorithms are designed to be in a discrete-time fashion to search the optimal solutions of the optimization problem in [3, 5, 8], while continuous-time strategies due to its relatively complete theoretical framework have been widely applied to the distributed optimization…”
Distributed subgradient algorithm for multi-agent optimization with directed communication topology
Yin, Y., Liu, Z., & Chen, Z. (2015) · IFAC-PapersOnLine · doi:10.1016/j.ifacol.2015.12.238 · Cited by 2
Wang, D., Ren, H., & Shao, F. (2017) · Symmetry · doi:10.3390/sym9080163 · Cited by 2
“Lobel and Ozdaglar [6] studied the consensus optimization problem over a time-varying network topolopy and proposed a distributed subgradient method that uses averaging algorithms for locally sharing information among the agents.”
MethodInfluentialDistributed Optimization on Unbalanced Time-Varying Topologies: Theories and Experiments
Li, Z., Zhao, T., & Ding, Z. (2018) · Chinese Control Conference (CCC) · doi:10.23919/chicc.2018.8484051 · Cited by 2
“To solve these optimization problems, most of existing works concentrate on designing consensus-based algorithms in discrete time (see [1–4]).”
MethodDistributed Algorithm for Discrete-Time Lyapunov Equations
Jiang, X., Zeng, X., Sun, J. Q., & Chen, J. (2018) · International Conference on Control, Automation, Robotics and Vision (ICARCV) · doi:10.1109/icarcv.2018.8581279 · Cited by 2
“Moreover, some effective discrete-time algorithms have been developed to solve the distributed optimization problems [17]–[19].”
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
“which can be also obtained following the proof line in [8].”
BackgroundMethodZhong, Y., Gao, W., Li, D., & Ren, H. (2019) · Chinese Control Conference (CCC) · doi:10.23919/chicc.2019.8866376 · Cited by 2
Consensus-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].”
MethodRobust Multi-Agent Optimization: Coping with Packet-Dropping Link Failures.Preprint
Su, L., & Vaidya, N. H. (2016) · arXiv (Cornell University) · Cited by 3
Distributed Optimization and Data Recovery for Wireless Networking
Masiero, R. (2011) · Padua Research Archive (University of Padova) · Cited by 2
Fully Stochastic Distributed Convex Optimization on Time-Varying Graph with Compression
Yau, C.-Y., & Wai, H.-T. (2023) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc49753.2023.10383992 · Cited by 1
“We also allow the agents to communicate on a random subgraph of G , similar to the model in [14].”
BackgroundResultMoothedath, S., & Vaswani, N. (2024) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp48485.2024.10447412 · Cited by 1
“Over the last decade, the formulation of decentralized GD and projected GD algorithms has garnered significant interest [11, 15, 16, 17, 18, 19, 20, 12], starting with the seminal work of Nedi ´ c et al. [11].”
BackgroundJin, Z., Li, H., Qin, Z., & Tian, Y. (2025) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2025.3549067 · Cited by 1
“To address this dynamic in solving the distributed optimization problem, some distributed algorithms have been proposed (see, e.g., [6], [7], [8], [9], [10], and [11]).”
Survey and prospects of distributed optimization in multi-agent systems
Jiang, X., Xianlin, Z. E. N. G., Sun, J. Q., & Chen, J. (2025) · Scientia Sinica Informationis · doi:10.1360/ssi-2025-0337 · Cited by 1
Practical Prescribed-Time Distributed Nonconvex Optimization via a Time-Base Generator
Lin, Q., Liu, Y., Lu, J., & Gui, W. (2025) · SIAM Journal on Control and Optimization · doi:10.1137/24m1685912 · Cited by 1
Distributed Gradient Methods Under Heavy-Tailed Communication Noise
Vuković, M., Jakovetić, D., Bajović, D., & Kar, S. (2026) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2026.3662065 · Cited by 1
“Distributed optimization has been extensively studied [1], [2], [4], [9], [19], [20], [24], [26], [32], [33], and different types of methods have been proposed, including distributed gradient-like [21], [30], [32], gradient-tracking [7], [8], [24], quasi-Newton [26] and Newton-like [18], dual…”
Synchronization of Unicycle Robots with Proximity Communication Networks
Liu, Z., Wang, J., & Xiaoming Hu, A. (2014) · IFAC Proceedings Volumes · doi:10.3182/20140824-6-za-1003.01416 · Cited by 1
“Actually, it is closely related to different engineering applications, such as rendezvous problem[5], parallel computing[6], distributed optimization [7] and formation control[8].”
BackgroundDistributed 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 for evolving networks of growing connectivity
Liu, S., Chen, P., & Hero, A. O. (2017) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp.2017.7952923 · Cited by 1
Distributed sourcing seeking via stochastic approximation algorithm with expanding truncations
Ren, X., & Liu, S. (2017) · International Conference on Control and Automation · doi:10.1109/icca.2017.8003088 · Cited by 1
Distributed optimization of energy storage units in non-ideal communication network
Ding, S., Zhou, X., & Guo, Q. (2017) · Chinese Control Conference (CCC) · doi:10.23919/chicc.2017.8027772 · Cited by 1
Distributed Stochastic Approximation Algorithm for Time-Varying Regression Function Over Network
Fu, K., Chen, H.-F., & Zhao, W. (2018) · Chinese Control Conference (CCC) · doi:10.23919/chicc.2018.8483554 · Cited by 1
“Most of the research on the distributed optimization is for the time-invariant objective function [9-11], but there already exist a few papers on the time-varying ones.”
BackgroundAnalog Implementation of Optimization Algorithms: A Distributed Optimization View
Matei, I., Feldman, A., & de Kleer, J. (2018) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2018.8618944 · Cited by 1
“There is a plethora of algorithms for setups ranging from unconstrained [2], [5], [13], to constrained [11], [12], [16] or stochastic [7], [9] cases.”
Event-Triggered Scheme-Based Distributed Optimization over Digital Network with Limited Data Rate
Li, H., Lü, Q., Wang, Z., Liao, X., & Huang, T. (2020) · Springer eBooks · doi:10.1007/978-981-15-6109-2_6 · Cited by 1
Touri, B. (2012) · Springer theses · doi:10.1007/978-3-642-28003-0_1 · Cited by 1
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
“Note that the results such as [11] will not imply the robustness of the algorithms to link failure as they assume that the resulting weight matrices remain doubly stochastic with probability one.”
BackgroundCompressed Sensor Caching and Collaborative Sparse Data Recovery With Anchor Alignment
Yang, Y.-J., Yang, M.-H., Wu, J.-Y., & Hong, Y.-W. P. (2025) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2025.3588354 · Cited by 1
“…techniques such as distributed and collaborative orthogonal matching pursuit (DC-OMP) algorithms [27], the distributed subgradient method (DSM) [28], distributed iterative hard /soft thresholding (DIHTA/ DISTA) algorithms [29], the quadratic penalty method [30], and the aforementioned ADMM…”
Xu, Y., Zhang, W., Liu, W., & Yu, W. (2020) · Wiley eBooks · doi:10.1002/9781119534938.ch7 · Cited by 1
First-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
“models and distributed algorithms for multi-agent optimization problems. In particular, incremental gradient/subgradient methods and their accelerated aggregated variants (Nedic and Ozdaglar (2009), Lobel and Ozdaglar (2011), Shi et al. (2015), Gurbuzbalaban et al. (2017)) have been studied where a local gradient/subg…”
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
“distributed sensor networks [6], coordination [13], and flow control [21]) have motivated a flurry of research on distributed approaches for solving optimization problems where the objective function is the sum of local objective functions of agents (nodes) that are connected through a network (see [7], [45], [44], [2…”
BackgroundSelf-citationGradient-Consensus Method for Distributed Optimization in Directed NetworksPreprint
Khatana, V., Saraswat, G., Patel, S., & Salapaka, M. V. (2019) · arXiv (Cornell University) · Cited by 1
Survey on stability of stochastic multi-agent systems
Ming, P., Jianchang, L., Tan, S., Jiang, Y., Zhang, W., & Chunying, J. (2013) · Chinese Control Conference (CCC)
An analog network approach to train RBF networks based on sparse recovery
Feng, R., Leung, C.-S., & Constantinides, A. G. (2014) · IEEE International Conference on Digital Signal Processing (DSP) · doi:10.1109/icdsp.2014.6900799
“(18) where ∂· is the subgradient operator [23].”
BackgroundYe, M. (2016) · DR-NTU (Nanyang Technological University) · doi:10.32657/10356/67002
“Switching communication among the agents was considered in [65] where a policy gradient based method was proposed and distributed optimization over random networks was considered in [63].”
MethodFrom coordinate descent to social sampling
Ghassemi, M. (2016) · doi:10.7282/t3m90btp
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
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.