Distributed Optimization Over Time-Varying Directed Graphs
The DOI matches its Crossref record; 35 of the 36 references it cites were found in a registry or an index; 2 of the 13 sources its claims cite were checked for support.
Abstract
We consider distributed optimization by a collection of nodes, each having access to its own convex function, whose collective goal is to minimize the sum of the functions. The communications between nodes are described by a time-varying sequence of directed graphs, which is uniformly strongly connected. For such communications, assuming that every node knows its out-degree, we develop a broadcast-based algorithm, termed the subgradient-push, which steers every node to an optimal value under a standard assumption of subgradient boundedness. The subgradient-push requires no knowledge of either the number of agents or the graph sequence to implement. Our analysis shows that the subgradient-push algorithm converges at a rate of O(\ln t √t). The proportionality constant in the convergence rate depends on the initial values at the nodes, the subgradient norms and, more interestingly, on both the speed of the network information diffusion and the imbalances of influence among the nodes.
Overview
CoChat Summary
TL;DR
The paper introduces the subgradient-push algorithm for distributed convex optimization over time-varying directed graphs that are uniformly strongly connected, requiring each node only to know its outdegree. It proves convergence to a common optimal solution and an objective convergence rate of \(O(\ln t/\sqrt{t})\).
Key findings
- The subgradient-push method drives all nodes to the same optimal point under convexity, nonempty optimal set, bounded subgradients, and standard decaying stepsize conditions.
- For stepsize \(\alpha(t)=1/\sqrt{t}\), the objective converges at rate \(O(\ln t/\sqrt{t})\), with the constant depending on initial values, subgradient norm bounds, the network diffusion speed \(\lambda\), and the influence-imbalance measure \(\delta\).
- For regular directed graphs, \(\delta=1\); in general, \(1/(\delta(1-\lambda))\) is bounded exponentially by \(n^{2nB}\) in the worst case, but for time-varying regular directed graphs it scales polynomially in \(n\).
- Simulations on a scalar quadratic estimation problem with \(n=1000\) nodes and threshold \(\|z(t)-\theta^*1\|\le 0.1\) show sub-geometric decay and time scaling linearly in the number of nodes from \(n=10\) to \(90\).
Methods
- Theoretical design and analysis of a broadcast-based distributed subgradient algorithm combining subgradient updates with the push-sum protocol over time-varying directed graphs.
- Convergence proofs rely on a perturbed push-sum protocol, consensus-product bounds, and deterministic supermartingale-type convergence lemmas; the rate proof uses \(\alpha(t)=1/\sqrt{t}\) and node-maintained running averages \(\tilde z_i(t)\).
- Simulations optimize \(F(\theta)=\sum_{i=1}^n p_i(\theta-u_i)^2\), with half the \(p_i\)'s set to zero and half uniformly random in \([0,1]\), Gaussian initial points, and graph sequences including random two-out-neighbor graphs and alternating undirected star graphs.
Limitations
- The paper states that Theorem 2 does not address convergence of the sequences \(\{\tilde z_i(t)\}\), and it lists open problems on how \(\lambda\) depends on graph-sequence properties and how \(\delta\) depends on combinatorial graph features such as diameters and smallest cuts.
- The text makes evident that the simulations are restricted to a scalar quadratic estimation problem and specific graph models, so empirical behavior for general convex functions or higher-dimensional problems is not demonstrated.
- The algorithm assumes every node knows its outdegree \(d_i(t)\) at every time \(t\), which is an implementation requirement rather than a limitation the paper frames as such.
Model-written summary. Check it against the paper before relying on it.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
2 Valid · 1 Not valid · 3 Not checked · 36 Own results and interpretations
A result the paper states — it cites no source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Here, we generalize this result by showing that the protocol remains convergent even if the state of the nodes is perturbed at each step, as long as the perturbations decay to zero.”
- Also stated in: § III. PERTURBED PUSH-SUM PROTOCOL · p. 5 · plain
“When the perturbations are nonzero, Lemma 1 states that if these perturbations decay to zero, then the push-sum method still converges.”
boostedstates a possible cause- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Rests on 2 assumptions not shown here.
- Also stated in: § III. PERTURBED PUSH-SUM PROTOCOL · p. 5 · plain
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Indeed, Theorem 2 shows that for a class of time-varying regular directed graphs, 1 / ( δ (1 -λ )) scales polynomially in n .”
boostedstates an association- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Rests on an assumption not shown here.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“The proportionality constant in the convergence rate depends on the initial values at the nodes, the subgradient norms and, more interestingly, on both the speed of the network information diffusion and the imbalances of influence among the nodes.”
- Also stated in: § I. INTRODUCTION · p. 1 · plain
“Our results show that it converges at a rate of O ( ln t/ √ t ) , where the constant depends, among other factors, on the information diffusion speed of the corresponding directed graph sequence and a measure of the influence imbalance among the nodes.”
plainstates an association- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Rests on 3 assumptions not shown here.
- Also stated in: § I. INTRODUCTION · p. 1 · plain
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Our analysis shows that the subgradientpush algorithm converges at a rate of O ( ln t/ √ t ) .”
- Also stated in: § B. Our results · p. 3 · boosted
“We then demonstrate that the subgradient-push converges at a rate of O (ln t/ √ t ) ; this is formally stated in the following theorem.”
boostedstates a cause- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Rests on 5 assumptions not shown here.
- Also stated in: § B. Our results · p. 3 · boosted
A result the paper states — it cites no source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“The subgradient-push requires no knowledge of either the number of agents or the graph sequence to implement.”
- Also stated in: § I. INTRODUCTION · p. 1 · plain
“By contrast, our results work in time-varying networks and are fully distributed, requiring no knowledge of either the graph sequence or the number of agents.”
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Rests on an assumption not shown here.
- Also stated in: § I. INTRODUCTION · p. 1 · plain
12 more claims
Create a free account to see all 42 claims and every source verdict.
- It may state two separate claims as one. 13
- Probably not a substantial claim. 8
- The quote only partly states this claim. 7
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?
The cited source says what the claim attributes to it.
In the citing paper
“Assumption 2 is typical for many results in multi-agent coordination and distributed optimization [42]. It is much weaker than the assumption of every G un ( k ) being connected.”
From Achieving Geometric Convergence for Distributed Optimization Over Time-Varying Graphs (2017) · cites this paper as [42]
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
Each contradiction between two passages listed here was confirmed by an independent check.
Rated minor: it would not touch a result — a value no result rests on, a p-value that stays on the same side of the significance level, or a conflict that is clerical, resolved elsewhere in the paper, or outside its own findings.
In the paper
§ B. Our results · p. 3
“Theorem 2: Suppose that all the assumptions of Theorem 1 hold, and let α ( t ) = 1 / √ t for t ≥ 1 .”
§ IV. CONVERGENCE RESULTS FOR SUBGRADIENT-PUSH METHOD · p. 12
“Also, by assumption we have ∑ ∞ t =1 α ( t ) = ∞ and ∑ ∞ t =1 α 2 ( t ) < ∞ .”
Citations
Cites
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
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 2×
“Distributed optimization of a sum of convex functions has received a surge of interest in recent years [18], [23], [9], [14], [12], [13], [28], [16], [3], [24], [5].”
BackgroundMethodStability of multiagent systems with time-dependent communication links
Moreau, L. (2005) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2004.841888 · Cited by 2,706
Distributed 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
Gossip-based computation of aggregate information
Kempe, D., Dobra, A., & Gehrke, J. (2004) · 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings. · doi:10.1109/sfcs.2003.1238221 · Cited by 1,480
Dual 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
Distributed optimization in sensor networks
Rabbat, M., & Nowak, R. (2004) · Proceedings of the 3rd international symposium on Information processing in sensor networks · doi:10.1145/984622.984626 · Cited by 901 · cited 1×
“For example, the problems including robust statistical inference [22], formation control [20], non-autonomous power control [25], distributed message routing [19], and spectrum access coordination [10], can be reduced to variations of this problem.”
Dual Averaging for Distributed Optimization: Convergence Analysis and Network Scaling
Duchi, J. C., Agarwal, A., & Wainwright, M. J. (2010) · Cited by 884
Convergence in Multiagent Coordination, Consensus, and Flocking
Blondel, V. D., Hendrickx, J. M., Olshevsky, A., & Tsitsiklis, J. N. (2006) · Proceedings of the 44th IEEE Conference on Decision and Control · doi:10.1109/cdc.2005.1582620 · Cited by 859
Self-citationDistributed Stochastic Subgradient Projection Algorithms for Convex Optimization
Sundhar Ram, S., Nedić, A., & Veeravalli, V. V. (2010) · Journal of Optimization Theory and Applications · doi:10.1007/s10957-010-9737-7 · Cited by 814 · cited 2×
“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-citation
Research works printed but not linked: 2
- [29] K.I. Tsianos. The role of the Network in Distributed Optimization Algorithms: Convergence Rates, Scalability, Communication / Computation Tradeoffs and Communication Delays . PhD thesis, McGill University, Dept. of Electrical and Computer Engineering, 2013. -
- [7] F. Iutzeler, P. Ciblat, and W. Hachem. Analysis of sum-weightlike algorithms for averaging inwireless sensor networks. IEEE Transactions on Signal Processing , 6(11), 2013. -
Cited by
Items 401–500 of 1,226
Randomized Gradient-Free Distributed Online Optimization via a Dynamic Regret Analysis
Pang, Y., & Hu, G. (2023) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2023.3237975 · Cited by 19
Distributed Online Private Learning of Convex Nondecomposable Objectives
Cheng, H., Liao, X., & Li, H. (2023) · IEEE Transactions on Network Science and Engineering · doi:10.1109/tnse.2023.3329832 · Cited by 18
“One employs the circulation-based protocol [39] for undirected communication (named as DPSDA-C), while the other utilizes the push-sum method [4] for the directed communication (named as DPSDA-PS).”
BackgroundMethodWang, D., Liu, J., Lian, J., & Wang, W. (2024) · Automatica · doi:10.1016/j.automatica.2024.111925 · Cited by 14
Distributed Nash Equilibrium Seeking Over Time-Varying Directed Communication Networks
Nguyen, D. T. A., Nguyen, D. T., & Nedić, A. (2025) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2025.3548155 · Cited by 28
“Specifically, in the proof of Lemma 4 of [14], using the lower bound [Wk]ii ≥ w and B = 1, we obtain δ′ ≥ w.”
InfluentialSelf-citationProximal minimization based distributed convex optimization
Margellos, K., Falsone, A., Garatti, S., & Prandini, M. (2016) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.1109/acc.2016.7525287 · Cited by 15
Delay-induced discrete-time consensus
Chen, Y., & Lü, J. (2017) · Automatica · doi:10.1016/j.automatica.2017.07.059 · Cited by 15
Hong, M., Razaviyayn, M., & Lee, J. D. (2018) · Cited by 19
Exponential Collapse of Social Beliefs over Weakly-connected Heterogeneous Networks
Matta, V., Santos, A., & Sayed, A. H. (2019) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp.2019.8683752 · Cited by 17
Distributed Gradient Descent: Nonconvergence to Saddle Points and the Stable-Manifold Theorem
Swenson, B., Murray, R., Poor, H. V., & Kar, S. (2019) · Allerton Conference on Communication, Control, and Computing · doi:10.1109/allerton.2019.8919658 · Cited by 18
Distributed learning of average belief over networks using sequential observations
Zhang, K., Liu, Y., Liu, J., Liu, M., & Başar, T. (2020) · Automatica · doi:10.1016/j.automatica.2020.108857 · Cited by 15
Distributed Value Function Approximation for Collaborative Multiagent Reinforcement Learning
Stanković, M. S., Beko, M., & Stanković, S. S. (2021) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2021.3061909 · Cited by 16
A population games transactive control for distributed energy resources
Baron-Prada, E., & Mojica‐Nava, E. (2021) · International Journal of Electrical Power & Energy Systems · doi:10.1016/j.ijepes.2021.106874 · Cited by 15
ADACHI, T., Hayashi, N., & Takai, S. (2021) · IET Control Theory and Applications · doi:10.1049/cth2.12127 · Cited by 18
Diffusion LMS With Correlated Regressors II: Performance
Piggott, M. J., & Solo, V. (2017) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2017.2703677 · Cited by 14
Wang, D., Chen, Y., Gupta, V., & Lian, J. (2020) · Journal of the Franklin Institute · doi:10.1016/j.jfranklin.2020.03.035 · Cited by 15
Liu, H., & Yu, W. (2020) · IEEE Transactions on Circuits & Systems II Express Briefs · doi:10.1109/tcsii.2020.2987947 · Cited by 16
Shi, X., Lin, Z., Zheng, R., & Wang, X. (2020) · International Journal of Control · doi:10.1080/00207179.2020.1854866 · Cited by 15
“Overall, the above existing algorithms can be divided into two parts: discrete-time algorithms (H. Li et al., 2019; Liang et al., 2019; Nedic & Olshevsky, 2015; Xi et al.,2018 ) and continuous-time algorithms (Cheng et al., 2019; C. Li et al., 2017; Z. Li et al., 2018; Liu et al.,2017 ; Lu & Tang,…”
BackgroundProjected Gradient Method for Decentralized Optimization over Time-Varying NetworksPreprint
Rogozin, A., & Gasnikov, A. V. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1911.08527 · Cited by 21
Multi-Agent Algorithms for Collective Behavior: A structural and application-focused atlasPreprint
Rossi, F., Bandyopadhyay, S., Wolf, M. T., & Pavone, M. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2103.11067 · Cited by 26
Distributed Adaptive Gradient Algorithm With Gradient Tracking for Stochastic Nonconvex Optimization
Han, D., Liu, K., Lin, Y., & Xia, Y. (2024) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2024.3380710 · Cited by 16
Resilience to Malicious Activity in Distributed Optimization for Cyberphysical Systems
Yemini, M., Nedić, A., Gil, S., & Goldsmith, A. J. (2022) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc51059.2022.9992416 · Cited by 27
Self-citationLiu, J., Ho, D. W. C., & Li, L. (2023) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2023.3264784 · Cited by 15
“The subgradient-push algorithm is constructed to solve DOPs over the time-varying network in [10].”
BackgroundMethodDistributed event-triggered optimization for multi-agent systems with disturbance rejection
Deng, Z., & Hong, Y. (2016) · International Conference on Control and Automation · doi:10.1109/icca.2016.7505245 · Cited by 14
Distributed big-data optimization via block-iterative convexification and averaging
Notarnicola, I., Sun, Y., Scutari, G., & Notarstefano, G. (2017) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2017.8263982 · Cited by 18
Distributed optimal consensus of multiple double integrators under bounded velocity and acceleration
Qiu, Z., Xie, L., & Hong, Y. (2019) · Control Theory and Technology · doi:10.1007/s11768-019-8179-5 · Cited by 12
Subgradient averaging for multi-agent optimisation with different constraint sets
Romao, L. B. R. R., Margellos, K., Notarstefano, G., & Papachristodoulou, A. (2021) · Automatica · doi:10.1016/j.automatica.2021.109738 · Cited by 16
Hayashi, N., Sugiura, T., Kajiyama, Y., & Takai, S. (2019) · IET Control Theory and Applications · doi:10.1049/iet-cta.2019.0377 · Cited by 16
“The extensions for directed and time-varying communication networks have also been considered in a large number of research articles [7–9].”
BackgroundGradient-free distributed optimization with exact convergence
Pang, Y., & Hu, G. (2022) · Automatica · doi:10.1016/j.automatica.2022.110474 · Cited by 15
“The same technique was applied to the algorithms in [29] and [30], [31], where the doubly stochastic requirement on the weighting matrix was removed by adopting a push-sum method [32] and a surplus-based method [33], respectively.”
BackgroundMethodCooperative convex optimization with subgradient delays using push-sum distributed dual averaging
Wang, C., Xu, S., Yuan, D., Chu, Y., & Zhang, Z. (2021) · Journal of the Franklin Institute · doi:10.1016/j.jfranklin.2021.07.015 · Cited by 14
Distributed hybrid optimization for multi-agent systems
Tan, X., Yang, Y., He, W., Cao, J., & Huang, T. (2022) · Science China Technological Sciences · doi:10.1007/s11431-022-2060-7 · Cited by 15
Boost Decentralized Federated Learning in Vehicular Networks by Diversifying Data Sources
Su, D., Zhou, Y., & Cui, L. (2022) · IEEE International Conference on Network Protocols (ICNP) · doi:10.1109/icnp55882.2022.9940426 · Cited by 22
Robust Multi-agent Optimization: Coping with Byzantine Agents with Input Redundancy
Su, L., & Vaidya, N. H. (2016) · Lecture notes in computer science · doi:10.1007/978-3-319-49259-9_29 · Cited by 14
Simultaneous social cost minimization and nash equilibrium seeking in non-cooperative games
Ye, M., & Hu, G. (2017) · Chinese Control Conference (CCC) · doi:10.23919/chicc.2017.8027826 · Cited by 14
Resilient distributed optimal generation dispatch for lossy AC microgrids
Zholbaryssov, M., Fooladivanda, D., & Domínguez-García, A. D. (2018) · Systems & Control Letters · doi:10.1016/j.sysconle.2018.10.007 · Cited by 15
Primal-Dual Subgradient Algorithm for Distributed Constraint Optimization Over Unbalanced Digraphs
Yang, Q., & Chen, G. (2019) · IEEE Access · doi:10.1109/access.2019.2925053 · Cited by 14
Distributed Finite-Time Termination for Consensus Algorithm in Switching Topologies
Saraswat, G., Khatana, V., Patel, S., & Salapaka, M. V. (2022) · IEEE Transactions on Network Science and Engineering · doi:10.1109/tnse.2022.3216286 · Cited by 17
Computational Convergence Analysis of Distributed Optimization Algorithms for Directed Graphs
Zhang, S., Yi, X., George, J., & Yang, T. (2019) · International Conference on Control and Automation · doi:10.1109/icca.2019.8899565 · Cited by 14
Mo, L., Hu, H., Yu, Y., et al. (2021) · Information Sciences · doi:10.1016/j.ins.2021.02.049 · Cited by 14
Stochastic Proximal Gradient Consensus Over Random NetworksPreprint
Hong, M., & Chang, T. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1511.08905 · Cited by 14
“It is the stochastic varian t of the so-calledB-strongly connected network which has been widely considered in the literature, under ve ry different context [1], [7], [18], [31].”
BackgroundDistributed Fixed-Time Algorithms for Time-Varying Constrained Optimization Problems
He, X., Li, Y., Zhang, M., et al. (2025) · IEEE Transactions on Artificial Intelligence · doi:10.1109/tai.2025.3556095 · Cited by 13
Başaran, K., Siano, P., Messlem, A., Candan, A. K., Kivi, M. M., Sakib, M. N., Arikuşu, Y. S., & Lăzăroiu, G. C. (2026) · Energy · doi:10.1016/j.energy.2026.139983 · Cited by 20
Distributed learning with infinitely many hypotheses
Nedić, A., Olshevsky, A., & Uribe, C. A. (2016) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2016.7799242 · Cited by 15
Self-citationA Second-Order Proximal Algorithm for Consensus Optimization
Wu, X., Qu, Z., & Lu, J. (2020) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2020.2996205 · Cited by 16
Decentralized Optimization on Time-Varying Directed Graphs Under Communication Constraints
Chen, Y., Hashemi, A., & Vikalo, H. (2021) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp39728.2021.9415052 · Cited by 14
Priority-Considered Load Shedding in Economic Dispatch: Distributed Optimization Approach
Fitri, I. R., & Kim, J. (2022) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2022.3231185 · Cited by 13
Distributed Optimization With Asynchronous Computation and Event-Triggered Communication
Dong, Z., Jin, Y., Mao, S., Ren, W., Du, W., & Tang, Y. S. (2024) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2024.3449140 · Cited by 18
Secure local filtering algorithms for distributed optimization
Sundaram, S., & Gharesifard, B. (2016) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2016.7798537 · Cited by 13
Cooperative optimal coordination for distributed energy resources
Yang, T., Wu, D. X., Ren, W., et al. (2017) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc.2017.8264614 · Cited by 13
Mo, L., Liu, X., Cao, X., & Yu, Y. (2020) · Journal of Systems Science and Complexity · doi:10.1007/s11424-020-9021-3 · Cited by 12
Distributed Gradient Flow: Nonsmoothness, Nonconvexity, and Saddle Point Evasion
Swenson, B., Murray, R., Poor, H. V., & Kar, S. (2021) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2021.3111853 · Cited by 14
“While a complete survey of this topic is beyond the scope of the paper, we note that key issues which have been addressed in this context include optimization over time-varying and directed communication networks [26], [27]; constrained optimization [28]–[30]; convergence rate analysis [31], [32]; and optimization of…”
BackgroundEvent‐triggered distributed algorithm for searching general Nash equilibrium with general step‐size
Li, R., & Mu, X. (2020) · Optimal Control Applications and Methods · doi:10.1002/oca.2688 · Cited by 13
“And this article proves that the general step-size not only solve the optimization problem with bounded constraint, 22-24 but can converge to the GNE of the noncooperation game problem with general constraint by using Lyapunov stability theory.”
BackgroundShi, X., Lin, Z., Yang, T., & Wang, X. (2020) · International Journal of Systems Science · doi:10.1080/00207721.2020.1858364 · Cited by 13
“To accomplish this work, a lot of excellent con-trol schemes have been designed (Li et al.,2019 , 2018; Lu & Tang, 2012; Nedic & Olshevsky, 2015; Rahili & Ren,2017 ; Xi et al., 2018; Zhao et al.,2018 ; Zhu et al., 2019) and references therein.”
MethodSuccess and failure of adaptation-diffusion algorithms for consensus in multi-agent networks
Morral, G., Bianchi, P., & Fort, G. (2014) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2014.7039609 · Cited by 13
Distributed stochastic optimization with gradient tracking over strongly-connected networksPreprint
Xin, R., Sahu, A. K., Khan, U. A., et al. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1903.07266 · Cited by 13
Cooperative Dynamic Target Tracking: Distributed Time-Varying Optimization for Multi-UAV System
Zhang, B., Hou, Y., Yin, H., et al. (2025) · IEEE Transactions on Aerospace and Electronic Systems · doi:10.1109/taes.2025.3574701 · Cited by 12
The Confluence of Evolutionary Computation and Multi-Agent Systems: A Survey
Chen, T.-Y., Chen, W., Wei, F.-F., Guo, X., Song, W.-X., Zhu, R., Lin, Q., & Zhang, J. (2025) · IEEE/CAA Journal of Automatica Sinica · doi:10.1109/jas.2025.125246 · Cited by 23
A Bayesian Framework for Distributed Estimation of Arrival Rates in Asynchronous Networks
Coluccia, A., & Notarstefano, G. (2016) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2016.2557313 · Cited by 12
Wang, D., Zhou, J., Wen, G., Lü, J., & Chen, G. (2023) · IEEE Transactions on Network Science and Engineering · doi:10.1109/tnse.2023.3274559 · Cited by 13
“Assumption 3 is used to ensure the feasibility of the event-triggered controller design, which is a common assump-tionintheliterature[7], [10] as pointedout in[36].”
BackgroundMethodDifferentially Private Distributed Optimization Over Diagraphs With Application to Image Deblurring
Yang, Z., He, W., & Yang, Y. (2024) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2024.3395851 · Cited by 14
A Distributed Primal–Dual Push-Sum Algorithm on Open Multiagent Networks
Sawamura, R., Hayashi, N., & Inuiguchi, M. (2024) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2024.3453382 · Cited by 12
Zhu, R., Wang, F., Liu, Z., & Chen, Z. (2025) · IEEE Transactions on Circuits and Systems I Regular Papers · doi:10.1109/tcsi.2025.3539277 · Cited by 12
Distributed subgradient-push online convex optimization on time-varying directed graphs
Akbari, M. A., Gharesifard, B., & Linder, T. (2014) · Allerton Conference on Communication, Control, and Computing · doi:10.1109/allerton.2014.7028465 · Cited by 12
Carli, R., Notarstefano, G., Schenato, L., & Varagnolo, D. (2015) · European Control Conference (ECC) · doi:10.1109/ecc.2015.7330916 · Cited by 11
Liu, J., Fullmer, D., Nedić, A., Başar, T., & Morse, A. S. (2017) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.23919/acc.2017.7963032 · Cited by 11
Self-citationFenchel dual gradient methods for distributed convex optimization over time-varying networks
Wu, X., & Lu, J. (2017) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2017.8264079 · Cited by 14
“, [4]–[6], [12], [13], [17], [19], [22], [24], [30]).”
BackgroundMethodInfluentialDistributed Signal Recovery Based on In-network Subspace Projections
Lorenzo, P. D., Barbarossa, S., & Sardellitti, S. (2019) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp.2019.8682719 · Cited by 11
Consensus with preserved privacy against neighbor collusion
Zhang, S., Timoudas, T. O., & Dahleh, M. A. (2020) · Control Theory and Technology · doi:10.1007/s11768-020-00023-x · Cited by 12
Ananduta, W., Nedić, A., & Ocampo‐Martínez, C. (2021) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2021.3092561 · Cited by 14
“Although it is possible to reformulate the problem into a consensus-based problem [13], the latter approach can become impractical when the number of agents is large because the information that must be exchanged is unnecessarily large.”
BackgroundSelf-citationUribe, C. A., Olshevsky, A., & Nedić, A. (2022) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2022.3140683 · Cited by 13
Self-citationDistributed and Privacy Preserving MPC With Global Constraints Over Time-Varying Communication
Zhao, D., Liu, D., & Liu, L. (2022) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2022.3203788 · Cited by 12
Hu, J., Chen, G., Li, H., Shen, Z., & Zhang, W. (2022) · IEEE Transactions on Network Science and Engineering · doi:10.1109/tnse.2022.3225229 · Cited by 13
Distributed optimization of strongly convex functions on directed time-varying graphs
Nedić, A., & Olshevsky, A. (2013) · IEEE Global Conference on Signal and Information Processing · doi:10.1109/globalsip.2013.6736882 · Cited by 14
Self-citationDistributed Optimization Over Networks
Nedić, A. (2018) · Lecture notes in mathematics · doi:10.1007/978-3-319-97142-1_1 · Cited by 13
Self-citationStochastic learning in multi-agent optimization: Communication and payoff-based approaches
Tatarenko, T. (2018) · Automatica · doi:10.1016/j.automatica.2018.10.001 · Cited by 14
Ravi, N., & Scaglione, A. (2019) · IFAC-PapersOnLine · doi:10.1016/j.ifacol.2019.12.185 · Cited by 17
Online Decentralized Decision Making With Inequality Constraints: An ADMM approach
Chen, Y., Santillo, M., Janković, M., & Ames, A. D. (2020) · IEEE Control Systems Letters · doi:10.1109/lcsys.2020.3044873 · Cited by 16
“3044873 topologies and time delays have also been considered in the literature [2], [4].”
Private Learning on Networks: Part IIPreprint
Gade, S., & Vaidya, N. H. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1703.09185 · Cited by 13
Newton-Raphson Consensus under asynchronous and lossy communications for peer-to-peer networksPreprint
Bof, N., Carli, R., Notarstefano, G., et al. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1707.09178 · Cited by 12
Swenson, B., Murray, R., Poor, H. V., & Kar, S. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2003.02818 · Cited by 42
Distributed Optimization With Global Constraints Using Noisy Measurements
Mai, V. S., La, R. J., Zhang, T., & Battou, A. (2023) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2023.3277312 · Cited by 17
Odeyomi, O. T., Tankard, E., & Rawat, D. B. (2023) · IEEE Transactions on Cognitive Communications and Networking · doi:10.1109/tccn.2023.3325815 · Cited by 11
Event-triggered distributed optimization for model-free multi-agent systems
Zheng, S., Liu, S., & Wang, L. (2023) · Frontiers of Information Technology & Electronic Engineering · doi:10.1631/fitee.2300568 · Cited by 11
Accelerating the Decentralized Federated Learning via Manipulating Edges
Zhou, M., Liu, G., Lu, K., Mao, R., & Liao, H. (2024) · International World Wide Web Conference (WWW) · doi:10.1145/3589334.3645509 · Cited by 19
Zhu, W., Wu, W., & Wang, Q. (2024) · IEEE Transactions on Signal and Information Processing over Networks · doi:10.1109/tsipn.2024.3485549 · Cited by 11
Momentum-Based Multiagent Approaches to Distributed Nonconvex Optimization
Xia, Z., Liu, Y., Kou, K. I., Lu, J., & Gui, W. (2024) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2024.3522188 · Cited by 13
Riemannian Optimization for Active Mapping With Robot Teams
Asgharivaskasi, A., Girke, F., & Atanasov, N. (2025) · IEEE Transactions on Robotics · doi:10.1109/tro.2025.3526295 · Cited by 25
An empirical comparison of multi-agent optimization algorithms
Assran, M., & Rabbat, M. (2017) · IEEE Global Conference on Signal and Information Processing · doi:10.1109/globalsip.2017.8309024 · Cited by 11
Zhang, J., Liu, L., & Ji, H. (2020) · Chinese Control Conference (CCC) · doi:10.23919/ccc50068.2020.9189181 · Cited by 11
Non-Bayesian Social Learning with Observation Reuse and Soft Switching
Bhotto, M. Z. A., & Tay, W. P. (2018) · ACM Transactions on Sensor Networks · doi:10.1145/3199513 · Cited by 11
“Equation (29) therefore simplifies to Using the relation [21–23] [ where λ ∈ ( 0 , 1 ) [23], the first term on the right-hand side of Equation (30) goes to zero almost surely.”
BackgroundNon-Bayesian Social Learning with Uncertain Models over Time-Varying Directed Graphs
Uribe, C. A., Hare, J. Z., Kaplan, L., & Jadbabaie, A. (2019) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc40024.2019.9029547 · Cited by 16
Distributed Algorithms for Computing a Common Fixed Point of a Group of Nonexpansive Operators
Li, X., & Feng, G. (2020) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2020.3004773 · Cited by 11
A Unifying Approximate Method of Multipliers for Distributed Composite Optimization
Wu, X., & Lu, J. (2022) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2022.3173171 · Cited by 21
“Another common approach is to emulate the centralized subgradient/gradient methods in a decentralized manner, such as the distributed subgradient methods [23]–[25] and the distributed gradient-tracking-based methods [26]–[34] where [31]–[34] utilize surrogate functions in order to realize the decentralized emulation.”
BackgroundLiu, J., & Xie, J. F. (2020) · International Journal of Systems Science · doi:10.1080/00207721.2020.1820622 · Cited by 11
Distributed multi-UAV trajectory optimization over directed networks
Liu, T., Han, D., Lin, Y., & Liu, K. (2021) · Journal of the Franklin Institute · doi:10.1016/j.jfranklin.2021.04.044 · Cited by 11
Kaheni, M., Usai, E., & Franceschelli, M. (2022) · IEEE Control Systems Letters · doi:10.1109/lcsys.2022.3173495 · Cited by 12
Private Learning on NetworksPreprint
Gade, S., & Vaidya, N. H. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1612.05236 · Cited by 21
“Solutions to distributed optimization of convex functions have been proposed for myriad scenarios involving directed graphs [15], link failures and losses [21], asynchronous communication models [14, 16, 22], stochastic objective functions [11,23,24], fault tolerance [25] and differential privacy [17].”
BackgroundLi, H., Fang, C., & Lin, Z. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1711.10802 · Cited by 22
Optimization over time-varying directed graphs with row and column-stochastic matricesPreprint
Saadatniaki, F., Xin, R., & Khan, U. A. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1810.07393 · Cited by 11
“The performance of TV-AB along with Push-DIGing [26], and subgradientpush [18] (with constant and diminishing step-sizes) is shown in Fig.”
BackgroundMethodInfluentialA Survey of Distributed Algorithms for Aggregative Games
Li, H., Li, J., Ran, L., Zheng, L., & Huang, T. (2025) · IEEE/CAA Journal of Automatica Sinica · doi:10.1109/jas.2024.124998 · Cited by 12
Zhao, Y., Liao, X., & He, X. (2023) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2023.3237496 · Cited by 10
“On the basis of push-sum technology or surplus value, DPGA was further employed for distributed convex optimization problems under directed communication networks equipped with row random weightmatricesin[9]and[15].”
Method
Metadata
- Authors
- Nedic, A., & Olshevsky, A.
- Affiliations
- University of Illinois Urbana-Champaign (US)
- ORCID
- Olshevsky, Alex
- Venue
- IEEE Transactions on Automatic Control
- Published
- 2015-03
- Volume
- 60
- Issue
- 3
- Pages
- 601-615
- ISSN
- 0018-9286 (ISSN-L)
- 1558-2523
- OpenAlex
- W2137435346
- Cited by
- 1,187
- References
- 33
- Citations by year
- 2026: 67 · 2025: 114 · 2024: 108 · 2023: 125 · 2022: 115 · 2021: 103 · 2020: 138 · 2019: 139 · 2018: 94 · 2017: 89 · 2016: 61 · 2015: 24
- FWCI
- 69.00
- Type
- journal article
- Language
- en
- Open access
- closed
- Locations
- IEEE Transactions on Automatic Control (publishedVersion)
- Funders
- National Science Foundation (NSF) (CMMI 07-42538, CCF 11-11342)
- ONR Navy Basic Research Challenge (N00014-12-1-0998)
- 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 › Engineering › Control and Systems Engineering › Advanced Control Systems Optimization
- Keywords
- distributed optimization, time-varying directed graphs, convex optimization, convergence rate, multi-agent systems
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.
The claim verdicts this report counts are experimental: their accuracy is not yet measured.
A language model drew the claims from the paper on 2026-10-10, under version 3 of the claim definition (model deepseek-v4.1-flash, prompt extract-v3).
A second model labelled each claim on 2026-10-10 (model jev-1.13-20260917, definition revision gold-guideline-v0.2).
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.