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 501–600 of 1,226
Distributed Algorithm for Continuous-Type Bayesian Nash Equilibrium in Subnetwork Zero-Sum Games
Zhang, H., Chen, G., & Hong, Y. (2023) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2023.3314576 · Cited by 14
Naderi, S., & Blondin, M. J. (2023) · IEEE Access · doi:10.1109/access.2023.3341295 · Cited by 14
An, Y., Wang, A., Zhang, X., & Xiao, F. (2024) · Systems & Control Letters · doi:10.1016/j.sysconle.2024.105733 · Cited by 10
Distributed Stochastic Projection-Free Algorithm for Constrained Optimization
Jiang, X., Zeng, X., Xie, L., et al. (2024) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2024.3481040 · Cited by 10
Volchenkov, D. (2025) · Mathematics · doi:10.3390/math13132116 · Cited by 12
Convergence of Infinite Products of Stochastic Matrices: A Graphical Decomposition Criterion
Chen, Y., Xiong, W., & Li, F. (2016) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2016.2521782 · Cited by 10
Lü, Q., Li, H., Liao, X., & Li, H. (2017) · International Conference on Information Science and Technology · doi:10.1109/icist.2017.7926783 · Cited by 10
Distributed discrete-time optimization by exchanging one bit of information
Zhang, J., You, K., & Başar, T. (2018) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.23919/acc.2018.8431279 · Cited by 10
“For the former consensus part, most methods require each agent to access the state values of its neighbors at each time, either exactly [6], [7] or in a quantized form [5].”
Distributed Optimization over General Directed Networks with Random Sleep Scheme
Wang, Z., Zheng, L., & Li, H. (2020) · International Journal of Control Automation and Systems · doi:10.1007/s12555-018-9543-9 · Cited by 10
The Barzilai–Borwein Method for distributed optimization over unbalanced directed networks
Hu, J., Chen, X., Zheng, L., Zhang, L., & Li, H. (2021) · Engineering Applications of Artificial Intelligence · doi:10.1016/j.engappai.2020.104151 · Cited by 13
“However, the method [25] shows relatively slow convergence rate due to the use of diminishing stepsizes.”
Distributed Primal-Dual Perturbation Algorithm Over Unbalanced Directed Networks
Sakuma, H., Hayashi, N., & Takai, S. (2021) · IEEE Access · doi:10.1109/access.2021.3082537 · Cited by 10
Event-Triggered Consensus-Based Optimization Algorithm for Smooth and Strongly Convex Cost Functions
Hayashi, N., Sugiura, T., Kajiyama, Y., & Takai, S. (2018) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2018.8618863 · Cited by 12
Hao, R., Lü, T., Wu, Q., Chen, X., & Ai, Q. (2019) · IEEE Access · doi:10.1109/access.2019.2908680 · Cited by 11
“The push-sum is a consensus-like method where every node updates its values by taking linear combinations of the values of its neighbors [27,28].”
MethodDistributed multi-step subgradient optimization for multi-agent system
Li, C., Chen, S., Li, J., & Wang, F. (2019) · Systems & Control Letters · doi:10.1016/j.sysconle.2019.04.008 · Cited by 11
Decentralized Stochastic Non-Convex Optimization over Weakly Connected Time-Varying Digraphs
Lu, S., & Wu, C. W. (2020) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp40776.2020.9053238 · Cited by 20
“Related work There have been fruitful results about decentralized algorithms for convex optimization problems over strongly connected digraphs [1, 14–17], such as distributed subgradient methods [1], perturbed push sum protocol [14], distributed inexact gradient and tracking (DIGing) technique [15], accelerated distri…”
BackgroundDistributed accelerated optimization algorithms: Insights from an ODE
Chen, R., Yang, T., & Chai, T. (2020) · Science China Technological Sciences · doi:10.1007/s11431-020-1596-8 · Cited by 10
Hybrid Decentralized Data Analytics in Edge-Computing-Empowered IoT Networks
Zhao, L., Li, F., & Valero, M. (2020) · IEEE Internet of Things Journal · doi:10.1109/jiot.2020.3040657 · Cited by 11
Convergence of an accelerated distributed optimisation algorithm over time‐varying directed networks
Hu, J., Yan, Y., Li, H., Wang, Z., Xia, D., & Guo, J. (2020) · IET Control Theory and Applications · doi:10.1049/cth2.12022 · Cited by 10
“The existing methods tackling distributed optimisation problems over directed networks are developed by the methods proposed in [16, 19, 20] that realise the imbalanced information transmission among agents by adopting average-consensus methods.”
MethodGradient-Push Algorithm for Distributed Optimization With Event-Triggered Communications
Kim, J., & Choi, W. (2022) · IEEE Access · doi:10.1109/access.2022.3233233 · Cited by 10
Hamedani, E. Y., & Aybat, N. S. (2017) · Allerton Conference on Communication, Control, and Computing · doi:10.1109/allerton.2017.8262781 · Cited by 11
Analysis of distributed ADMM algorithm for consensus optimisation over lossy networks
Majzoobi, L., Shah‐Mansouri, V., & Lahouti, F. (2018) · IET Signal Processing · doi:10.1049/iet-spr.2018.0033 · Cited by 13
Relaxed hybrid consensus ADMM for distributed convex optimisation with coupling constraints
Olama, A., Bastianello, N., Mendes, P. R. D. C., & Camponogara, E. (2019) · IET Control Theory and Applications · doi:10.1049/iet-cta.2018.6260 · Cited by 13
“In this section, we evaluate the convergence rate of the proposed algorithm applied to a DQP in the same form of problem (D), and compared it with the DGDM [40] and the original H-ADMM [30].”
Mo, L., Li, J., & Huang, J. (2019) · IEEE Access · doi:10.1109/access.2019.2925414 · Cited by 10
Distributed Optimization of Convex Sum of Non-Convex FunctionsPreprint
Gade, S., & Vaidya, N. H. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1608.05401 · Cited by 14
On Nonconvex Decentralized Gradient DescentPreprint
Zeng, J., & Yin, W. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1608.05766 · Cited by 10
Lei, J., & Shanbhag, U. V. (2018) · arXiv (Cornell University) · Cited by 7
Distributed Stochastic Gradient Descent and Convergence to Local MinimaPreprint
Swenson, B., Murray, R., Kar, S., & Poor, H. V. (2020) · arXiv (Cornell University) · Cited by 9
BlueFog: Make Decentralized Algorithms Practical for Optimization and Deep LearningPreprint
Ying, B., Yuan, K., Hu, H., Chen, Y., & Yin, W. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2111.04287 · Cited by 35
Distributed Bayesian Estimation of Continuous Variables Over Time-Varying Directed Networks
Paritosh, P., Atanasov, N., & Martı́nez, S. (2022) · IEEE Control Systems Letters · doi:10.1109/lcsys.2022.3167654 · Cited by 9
Liu, H., Yu, W., Wen, G., et al. (2024) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2024.3469048 · Cited by 9
Lin, Y., Li, W., Zhang, B., & Du, J. (2024) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2024.3492329 · Cited by 13
Xia, L., Li, Q., & Song, R. (2024) · Neurocomputing · doi:10.1016/j.neucom.2024.128954 · Cited by 9
Distributed Online Optimization with Edge-Based Event-Triggered communication
Mao, S., Mishra, Y., Tian, Y., Perc, M., & Tang, Y. S. (2024) · Automatica · doi:10.1016/j.automatica.2024.112068 · Cited by 11
Distributed Online Optimization Of Consensus-Based Adaptive Gradients Over Time-Varying Networks
Sheng, Q., Shi, X., & Su, Y. (2025) · IEEE Transactions on Industrial Cyber-Physical Systems · doi:10.1109/ticps.2025.3538690 · Cited by 9
Yang, Z., He, W., & Yang, S. (2025) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2025.3544517 · Cited by 13
Distributed Optimization Over Dependent Random Networks
Aghajan, A., & Touri, B. (2022) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2022.3216970 · Cited by 15
Logarithmic Regret for Distributed Online Subgradient Method over Unbalanced Directed Networks
YAMASHITA, M., Hayashi, N., Hatanaka, T., et al. (2021) · IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences · doi:10.1587/transfun.2020eap1111 · Cited by 9
Distributed optimization with hybrid linear constraints for multi‐agent networks
Zheng, Y., Liu, Q., & Wang, M. (2021) · International Journal of Robust and Nonlinear Control · doi:10.1002/rnc.5927 · Cited by 9
“Substituting (27) and (28) into (26), there is”
BackgroundLinear Convergence of ADMM Under Metric Subregularity for Distributed Optimization
Pan, X., Liu, Z., & Chen, Z. (2022) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2022.3185178 · Cited by 12
Wang, Z., Chen, G., & Li, H. (2022) · Energy Conversion and Economics · doi:10.1049/enc2.12061 · Cited by 9
Zeng, S., Doan, T. T., & Romberg, J. (2022) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2022.3201034 · Cited by 24
Li, W., Tang, R., & Wang, S. (2022) · Energy and Built Environment · doi:10.1016/j.enbenv.2023.02.001 · Cited by 10
Fast distributed optimization over directed graphs
Xi, C., Wu, Q., & Khany, U. A. (2016) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.1109/acc.2016.7526694 · Cited by 9
Convergence Rate of Distributed Subgradient Methods under Communication Delays
Doan, T. T., Beck, C. L., & Srikant, R. (2018) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.23919/acc.2018.8431382 · Cited by 11
Multi-cluster distributed optimization via random sleep strategy
Shi, C., & Yang, G. (2019) · Journal of the Franklin Institute · doi:10.1016/j.jfranklin.2019.03.021 · Cited by 11
Zimmermann, J., Tatarenko, T., Willert, V., & Adamy, J. (2020) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc42340.2020.9304360 · Cited by 12
Distributed Generalized Nash Equilibrium Seeking of N-Coalition Games with Inequality Constraints
Sun, C., & Hu, G. (2021) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc45484.2021.9683359 · Cited by 9
“2, 2, 4, 3, 3, 3, 3, 3], A4 = [1, 2, 5, 1, 1, 2, 1, 2, 1, 1], b1 = −20, b2 = b3 = b4 = 180.”
Distributed Gaussian learning over time-varying directed graphs
Nedić, A., Olshevsky, A., & Uribe, C. A. (2016) · 2018 52nd Asilomar Conference on Signals, Systems, and Computers · doi:10.1109/acssc.2016.7869674 · Cited by 9
Self-citationOn Increasing Self-Confidence in Non-Bayesian Social Learning over Time-Varying Directed Graphs
Uribe, C. A., & Jadbabaie, A. (2019) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.23919/acc.2019.8815382 · Cited by 10
Distributed Randomized Gradient-Free Mirror Descent Algorithm for Constrained OptimizationPreprint
Yu, Z., Ho, D. W. C., & Yuan, D. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1903.04157 · Cited by 9
Decentralized Consensus Optimization with Asynchrony and DelaysPreprint
Wu, T., Yuan, K., Ling, Q. H., et al. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1612.00150 · Cited by 9
Accelerated Gradient Tracking over Time-varying Graphs for Decentralized OptimizationPreprint
Li, H., & Lin, Z. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2104.02596 · Cited by 42
Bai, N., Wang, Q., Duan, Z., et al. (2025) · Automatica · doi:10.1016/j.automatica.2025.112381 · Cited by 8
Stochastic Event-Triggered Algorithm for Distributed Convex Optimization
Tsang, K. F. E., Huang, M., Shi, L., & Johansson, K. H. (2022) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2022.3229769 · Cited by 8
“Nedi´c and Olshevsky [13] further developed a subgradient-push algorithm based on the subgradient method and showed that it works under weaker assumptions.”
MethodA Unified Framework for Continuous-Time Unconstrained Distributed Optimization
Touri, B., & Gharesifard, B. (2023) · SIAM Journal on Control and Optimization · doi:10.1137/21m1442711 · Cited by 12
A distributed consensus based algorithm for economic dispatch over time‐varying digraphs
Xu, K., Guo, F., & Yan, G. (2023) · IET Control Theory and Applications · doi:10.1049/cth2.12526 · Cited by 9
Energy-Efficient Connectivity-Aware Learning Over Time-Varying D2D Networks
Parasnis, R., Hosseinalipour, S., Chu, Y.-W., Chiang, M., & Brinton, C. G. (2024) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2024.3374591 · Cited by 9
Distributed Stochastic Optimization with Gradient Tracking over Time- Varying Directed Networks
Nguyen, D. T. A., Nguyen, D. T., & Nedić, A. (2023) · Asilomar Conference on Signals, Systems and Computers (ACSSC) · doi:10.1109/ieeeconf59524.2023.10477004 · Cited by 13
Self-citationMulti-agent Online Optimization
Yuan, D., Proutière, A., & Shi, G. (2024) · Foundations and Trends® in Optimization · doi:10.1561/2400000037 · Cited by 18
Towards Totally Asynchronous Primal-Dual Convex Optimization in Blocks
Hendrickson, K., & Hale, M. (2020) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc42340.2020.9304003 · Cited by 8
Melbourne, J., Saraswat, G., Khatana, V., Patel, S., & Salapaka, M. V. (2020) · IFAC-PapersOnLine · doi:10.1016/j.ifacol.2020.12.971 · Cited by 13
“…distributed machine learning, see Predd et al. (2009), multi-agent control and co-ordination, see Fax and Murray (2002); Olfati-Saber et al. (2007), distributed optimization problems, see Nedić and Olshevsky (2014); Khatana et al. (2019), distributed sensor localization, see Khan et al. (2009).”
BackgroundDistributed Kalman filter with fuzzy noises over multiagent systems under switching topology
Zhang, X., Lin, H., Liu, G., et al. (2021) · Digital Signal Processing · doi:10.1016/j.dsp.2021.103326 · Cited by 8
Distributed ergodic algorithms for mixed equilibrium problems: Absent of cut property
Lu, K., Zhu, Q., & Yan, X. (2022) · Automatica · doi:10.1016/j.automatica.2022.110297 · Cited by 8
Privacy-Preserving Dual Stochastic Push-Sum Algorithm for Distributed Constrained Optimization
Gu, C., Jiang, L., Li, J., & Wu, Z. (2023) · Journal of Optimization Theory and Applications · doi:10.1007/s10957-023-02173-9 · Cited by 7
Resilient Distributed Optimization*
Zhu, J., Lin, Y., Velasquez, A., et al. (2023) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.23919/acc55779.2023.10156564 · Cited by 8
“Its extension to directed graphs has been studied in [34] and recently further analyzed in [35].”
BackgroundNoise Resilient Distributed Average Consensus Over Directed Graphs
Khatana, V., & Salapaka, M. V. (2023) · IEEE Transactions on Signal and Information Processing over Networks · doi:10.1109/tsipn.2023.3324583 · Cited by 13
“Proof: Recall (27) and (31), From [25] Corollary 2, there exists stochastic vectors v ( k ) ∈ R n and constants C, λ ∈ (0 , 1) such that for any given i , for all j = 1 , . . . , n, Multiplying M ( k + 1) onbothsidesto(31)and v ( k + 1) to(41) and subtracting we get, Define D ( l, k ) := W ( l, k )…”
BackgroundMethodDistributed Bayesian estimation of arrival rates in asynchronous monitoring networks
Coluccia, A., & Notarstefano, G. (2014) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp.2014.6854564 · Cited by 7
Fast centralized integer resource allocation algorithm and its distributed extension over digraphs
Xu, Y., Yan, G., Cai, K., et al. (2017) · Neurocomputing · doi:10.1016/j.neucom.2017.03.089 · Cited by 8
Li, H., Liu, S., Soh, Y. C., Xie, L., & Xia, D. (2017) · Chinese Control and Decision Conference (CCDC) · doi:10.1109/ccdc.2017.7978291 · Cited by 13
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
“For time-varying graphs, a common assumption is that the graph sequence {G(t)} is uniformly strongly connected (Nedić and Olshevsky, 2015), i.”
BackgroundMo, L., & Lin, P. (2019) · Chinese Control and Decision Conference (CCDC) · doi:10.1109/ccdc.2019.8833262 · Cited by 8
Distributed Composite Optimization Over Relay-Assisted Networks
Shi, C., & Yang, G. (2020) · IEEE Transactions on Systems Man and Cybernetics Systems · doi:10.1109/tsmc.2019.2963452 · Cited by 8
“As stated in [32], the mobile networks are often characterized by timevarying network topology, where the time-varying links are used to describe the scenario that nodes move in and out of line-of-sight of each other.”
BackgroundMomentum methods for stochastic optimization over time-varying directed networks
Cui, Z., Fan, Q., & Jia, C. (2020) · Signal Processing · doi:10.1016/j.sigpro.2020.107614 · Cited by 12
Bilevel Distributed Optimization in Directed Networks
Yousefian, F. (2021) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.23919/acc50511.2021.9483429 · Cited by 22
Alaviani, S. S., & Elia, N. (2021) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2021.3070223 · Cited by 11
“The differences with the work of [61] are: 1) the weight of a link in [61], and other work such as [9], to cite a few, takes values in a set having finite cardinality, whereas here the weight takes values in a continuum set; and 2) the weight of each link, taking values in this continuum set, is a…”
BackgroundDecentralized Consensus Algorithm with Delayed and Stochastic GradientsPreprint
Sirb, B., & Ye, X. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1604.05649 · Cited by 8
Distributed Online Optimization for Multi-Agent Networks with Coupled Inequality ConstraintsPreprint
Li, X., Yi, X., & Xie, L. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1805.05573 · Cited by 8
Asynchronous Decentralized Successive Convex ApproximationPreprint
Tian, Y., Sun, Y., & Scutari, G. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1909.10144 · Cited by 10
Variance-Reduced Decentralized Stochastic Optimization with Gradient Tracking--Part I: GT-SAGAPreprint
Xin, R., Khan, U. A., & Kar, S. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1909.11774 · Cited by 14
Decentralized Convex Optimization over Time-Varying Graphs
Rogozin, A., Gasnikov, A. V., Beznosikov, A., & Kovalev, D. A. (2023) · Springer eBooks · doi:10.1007/978-3-030-54621-2_860-1 · Cited by 7
“These results were generalized to directed graphs in [42].”
ResultLiu, X., Zhou, Y., Wu, D., Hu, M., Chen, M., Guizani, M., & Sheng, Q. Z. (2025) · IEEE Transactions on Networking · doi:10.1109/ton.2025.3526866 · Cited by 11
Mobility-Aware Decentralized Federated Learning for Autonomous Underwater Vehicles
He, H., Du, J., Jiang, C., Wang, J., Song, J., & Han, Z. (2025) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2025.3557803 · Cited by 7
DRACO: Decentralized Asynchronous Federated Learning Over Row-Stochastic Wireless Networks
Jeong, E., & Kountouris, M. (2025) · IEEE Open Journal of the Communications Society · doi:10.1109/ojcoms.2025.3574098 · Cited by 12
A gradient‐free distributed optimization method for convex sum of nonconvex cost functions
Pang, Y., & Hu, G. (2022) · International Journal of Robust and Nonlinear Control · doi:10.1002/rnc.6266 · Cited by 8
Game-Theoretic Distributed Empirical Risk Minimization With Strategic Network Design
Liu, S., Li, T., & Zhu, Q. (2023) · IEEE Transactions on Signal and Information Processing over Networks · doi:10.1109/tsipn.2023.3306106 · Cited by 19
Dynamic Regret of Distributed Online Saddle Point Problem
Zhang, W., Shi, Y., Zhang, B., Yuan, D., & Xu, S. (2023) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2023.3312033 · Cited by 7
“In recent years, the distributed optimization problems related to multiagent networks have received extensive attention; see, for example, [1], [2], [3], [4], [5], [6], and [7].”
BackgroundScalable Distributed Optimization of Multi-Dimensional Functions Despite Byzantine Adversaries
Kuwaranancharoen, K., Xin, L., & Sundaram, S. (2024) · IEEE Transactions on Signal and Information Processing over Networks · doi:10.1109/tsipn.2024.3379844 · Cited by 10
“Although our approach can recover the distributed subgradient method [8], [31] when selecting the parameter F = 0 , in the worst case scenario, there is no way to determine the number of Byzantine agents.”
BackgroundMethodChen, Y., Ma, Q., Jin, P., & Xu, S. (2025) · IEEE Transactions on Fuzzy Systems · doi:10.1109/tfuzz.2025.3542497 · Cited by 8
Resilient distributed optimization algorithm against adversary attacks
Zhao, C., He, J., & Qing-guo, W. (2017) · International Conference on Control and Automation · doi:10.1109/icca.2017.8003106 · Cited by 7
A Lie bracket approximation approach to distributed optimization over directed graphs
Michalowsky, S., Gharesifard, B., & Ebenbauer, C. (2019) · Automatica · doi:10.1016/j.automatica.2019.108691 · Cited by 7
“Besides several results on distributed computation [5], controllability and stabilization [6, 7, 8], there also exists a vast body of literature on distributed optimization algorithms, both in discrete- [9, 3] and continuous-time [10, 11, 12, 13, 14, 15], where in the present work we will focus on the latter one.”
Network flows as least squares solvers for linear equations
Liu, Y., Lou, Y., Anderson, B. D. O., et al. (2017) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc.2017.8263795 · Cited by 7
Distributed big-data optimization via block communications
Notarnicola, I., Sun, Y., Scutari, G., & Notarstefano, G. (2017) · IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing · doi:10.1109/camsap.2017.8313176 · 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
Tatarenko, T., Zimmermann, J., Willert, V., & Adamy, J. (2019) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc40024.2019.9029861 · Cited by 7
A Decentralized Primal-Dual Method for Constrained Minimization of a Strongly Convex Function
Hamedani, E. Y., & Aybat, N. S. (2021) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2021.3130082 · Cited by 11
Differential Privacy of Online Distributed optimization under Adversarial Nodes
Hou, M., Li, D., Wu, X., & Shen, X. (2019) · Chinese Control Conference (CCC) · doi:10.23919/chicc.2019.8865820 · Cited by 7
Totally Asynchronous Primal-Dual Convex Optimization in Blocks
Hendrickson, K., & Hale, M. (2023) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2022.3203366 · Cited by 8
Distributed Online Optimization with Byzantine Adversarial Agents
Sahoo, S., Gokhale, A., & Kalaimani, R. K. (2022) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.23919/acc53348.2022.9867506 · Cited by 7
Uribe, C. A., Olshevsky, A., & Nedić, A. (2022) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2022.3140698 · Cited by 8
Self-citationOlama, A., Camponogara, E., & Mendes, P. R. D. C. (2022) · Journal of Global Optimization · doi:10.1007/s10898-022-01266-5 · Cited by 7
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.