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 1,101–1,200 of 1,226
Gao, W., Xie, Y., & Ren, H. (2023) · Optimal Control Applications and Methods · doi:10.1002/oca.3000
Noise-robust distributed resource allocation with uncoordinated step-sizes
Wu, W., Zhu, S., Liu, S., et al. (2023) · Scientia Sinica Informationis · doi:10.1360/ssi-2023-0022
Robust Network Topologies for Distributed Learning
Wang, C., & Vlaski, S. (2023) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp49357.2023.10094739 · Cited by 1
Controllability in Multiplex Biological Networks withInsights into Virus-Related DiseasesPreprint
Behrouzinia, S., Khanteymoori, A., & Dehghanian, F. (2023) · Research Square · doi:10.21203/rs.3.rs-3265424/v1
Design of Event-Triggered Distributed Optimization Algorithms over Directed Graphs
Xian, C., Liu, Y., Feng, Y., et al. (2023) · Chinese Control Conference (CCC) · doi:10.23919/ccc58697.2023.10240830
An Algorithm for Decentralized Multi-agent Feasibility Problems
Pinyagina, O. (2023) · Communications in computer and information science · doi:10.1007/978-3-031-43257-6_2
A Stochastic Gradient-Based Projection Algorithm for Distributed Constrained Optimization
Zhang, K., Gao, S., Chen, Y., Zheng, Z., & Lü, Q. (2023) · Lecture notes in computer science · doi:10.1007/978-981-99-8079-6_28
Distributed Energy Cooperation in Multicell Wireless Powered Communication Networks
Li, G., Nie, X., Huang, Y., & Yu, W. (2023) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2023.3345404
“Lemma1[40]: Let { s k | k = 1 , 2 , . . . } beanonnegativescalar sequence satisfying the following where Then ∞ k = 1 b k ∞ and lim k →∞ s k = (cid:12) hold for a constant (cid:12) ≤ 0.”
BackgroundWang, D., Zhu, D., Sou, K. C., et al. (2023) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc49753.2023.10383341
“Lemma 2 presents a bound on the consensus error of the dual variables whose proof refers to Lemma 1 in [16].”
BackgroundA Fully Asynchronous Newton Tracking Method for Decentralized Optimization
Pan, Z., & Liu, H. (2023) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc49753.2023.10384028
Distributed Zeroth-order Optimization Over Directed Graphs
Zhao, F. (2023) · Youth Academic Annual Conference of Chinese Association of Automation (YAC) · doi:10.1109/yac59482.2023.10401358
Accelerated Dynamical Approaches for a Class of Distributed Optimization with Set Constraints
Wang, Y., Mei, X., & Jiang, H. (2023) · International Conference on New Trends in Computational Intelligence (NTCI) · doi:10.1109/ntci60157.2023.10403724
Distributed consensus protocols for cooperative decision-making
Zhang, H., Huang, C., Wang, Z., & Yan, H. (2024) · Elsevier eBooks · doi:10.1016/b978-0-44-321859-0.00012-8
(2024) · Elsevier eBooks · doi:10.1016/b978-0-44-321859-0.00025-6
Event-Triggered Distributed NE Seeking Over Directed Networks
Tao, Q., Xian, C., & Zhao, Y. (2024) · Lecture notes in electrical engineering · doi:10.1007/978-981-97-3324-8_8
Yan, J., Shi, X., Guo, L., et al. (2024) · Lecture notes in electrical engineering · doi:10.1007/978-981-97-3324-8_2
Privacy Preserving Distributed Optimization via Paillier Encryption and Randomness Injection
Cheng, X., Gao, H. B., Zhi, Y., & Zhang, S. (2024) · Lecture notes in electrical engineering · doi:10.1007/978-981-97-3324-8_23
An edge‐based event‐triggered delayed distributed algorithm for economic dispatch in smart grids
Ren, C., Hu, X., Zhao, H., et al. (2024) · IET Control Theory and Applications · doi:10.1049/cth2.12720
Privacy Preserving-Based Approach for Economic Power Dispatch in a Smart Grid
Yan, X., Gao, H. B., & Zhao, Y. (2024) · Chinese Control and Decision Conference (CCDC) · doi:10.1109/ccdc62350.2024.10588151
Wu, X., & Fu, J. (2024) · Youth Academic Annual Conference of Chinese Association of Automation (YAC) · doi:10.1109/yac63405.2024.10598812
Distributed Optimal Consensus of Second-order MASs over Directed Graphs*
Wang, D. (2024) · Youth Academic Annual Conference of Chinese Association of Automation (YAC) · doi:10.1109/yac63405.2024.10598607
Su, L., Hua, Y., Dong, X., et al. (2024) · doi:10.1109/icca62789.2024.10591857
Extremum-seeking Based Approach for Distributed Noncooperative N-coalition Games
Ma, T., Deng, Z., & Hu, C. G. (2024) · International Journal of Control Automation and Systems · doi:10.1007/s12555-023-0015-5
Liu, J. (2024) · International Journal of Control · doi:10.1080/00207179.2024.2387300
Heterogeneous Distributed Subgradient
Lin, Y., Gamarra, M., & Liu, J. (2024) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.23919/acc60939.2024.10645037
On f-Consensus Problems Solvable via Distributed Convex Optimization Methods
Yu, S., & Huang, C. (2024) · Chinese Control Conference (CCC) · doi:10.23919/ccc63176.2024.10662494
Piaseczny, A., Ruzomberka, E., Parasnis, R., & Brinton, C. G. (2024) · IEEE Internet of Things Journal · doi:10.1109/jiot.2024.3462674 · Cited by 2
A Distributed Convex Optimization Algorithm over Directed Networks with Time Delay
Wei, Y., Xie, J. F., Gao, W., et al. (2024) · Chinese Control Conference (CCC) · doi:10.23919/ccc63176.2024.10662519
A Distributed Algorithm for Tracking General Functions in Disturbed Multi-agent Systems
Jiang, R., Wang, H., & Chen, F. (2024) · Chinese Control Conference (CCC) · doi:10.23919/ccc63176.2024.10662466
Wang, C., Wang, F., & Chen, Z. (2024) · Lecture notes in electrical engineering · doi:10.1007/978-981-97-8658-9_56
A vector almost-supermartingale convergence theorem and its applications
Mahajan, A., Niculescu, S., & Vidyasagar, M. (2024) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc56724.2024.10886079 · Cited by 1
Zhu, Y., Li, Q., Li, T., & Wen, G. (2024) · IEEE Transactions on Network Science and Engineering · doi:10.1109/tnse.2024.3506732
Asynchronous Algorithms in Distributed Optimization Over Multi-Agent Network
You, K., & Du, Y. (2024) · Elsevier eBooks · doi:10.1016/b978-0-443-14081-5.00084-2
A Survey of Distributed Optimization
Yu, W., Zhu, Y., & Liu, H. (2024) · Elsevier eBooks · doi:10.1016/b978-0-443-14081-5.00077-5
Distributed Constrained Online Optimization for Time-Varying Economic Dispatch Under Feedback Delays
Hao, J., Li, F., Wang, X., et al. (2024) · doi:10.1109/icaica63239.2024.10823025
Decentralized Federated Learning: Model Update Tracking Under Imperfect Information Sharing
Chellapandi, V. P., Upadhyay, A., Hashemi, A., & Żak, S. H. (2024) · IEEE International Conference on Big Data (BigData) · doi:10.1109/bigdata62323.2024.10825274 · Cited by 4
Advanced Distributed Optimization and Control Algorithms: Theory and Applications
Zhang, S. (2022) · University of North Texas Digital Library (University of North Texas) · doi:10.12794/metadc1944275 · Cited by 1
Stabilization and Performance Improvement of Control Systems under State Feedback
Yao, L. (2022) · University of North Texas Digital Library (University of North Texas) · doi:10.12794/metadc1944321
Distributed Stochastic Averaging Gradient Algorithm over Directed Graph
Zhao, J., & Gao, W. (2024) · China Automation Congress (CAC) · doi:10.1109/cac63892.2024.10865751
Distributed Consensus, Optimization and Computation in Networked Systems
Yao, L. (2018) · University of North Texas Digital Library (University of North Texas) · doi:10.12794/metadc1404555
Estimation Network Design framework for efficient distributed optimization
Bianchi, M., & Grammatico, S. (2024) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc56724.2024.10885996
Distributed Optimization of Heterogeneous Agents by Adaptive Dynamic Programming
Yang, H., Xie, K., Yu, X. P., et al. (2024) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc56724.2024.10885818
An O(1/k) algorithm for multi-agent optimization with inequality constraints
Li, P., Zhao, Y., Hu, J., & Ji, J. (2025) · Neurocomputing · doi:10.1016/j.neucom.2025.129770 · Cited by 1
Distributed Dual Decomposition Method with Self-Triggered Communication
OGAWA, G., Hayashi, N., & Inuiguchi, M. (2025) · IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences · doi:10.1587/transfun.2024eap1170
Xu, Q., & Luo, S. (2023) · International Conference on Networking Systems of AI (INSAI) · doi:10.1109/insai60116.2023.00045
A universal framework for nabla nonlinear distributed optimisation algorithms
Jiang, X., Wei, Y., Tao, M., et al. (2025) · International Journal of Systems Science · doi:10.1080/00207721.2025.2507841
Almost sure convergence of distributed optimization with imperfect information sharing
Reisizadeh, H., Gokhale, A., Touri, B., & Mohajer, S. (2025) · Automatica · doi:10.1016/j.automatica.2025.112391 · Cited by 5
“Under perfect information sharing assumption, a subgradient-push algorithm is proposed for (strongly) convex loss functions in [13].”
Byzantine-Resilient Multiagent Distributed Optimization Under Redundancy
Zhai, Y., Liu, Z., Yue, D., Hu, S., Deng, C., & Ye, L. (2025) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2025.3583622 · Cited by 1
A variance‐reduced distributed stochastic momentum algorithm over directed networks
Gong, X., Gao, J., & Liu, X. (2025) · Asian Journal of Control · doi:10.1002/asjc.3775 · Cited by 1
Distributed Online Optimization With Communication And Feedback Delays
Wang, H., Xu, Y., & Mao, S. (2025) · International Symposium on Autonomous Systems (ISAS) · doi:10.1109/icaisisas64483.2025.11051547
Stochastic Aggregative Games with Coupled Inequality Constraints
Du, K., Meng, M., & Li, X. (2025) · doi:10.1109/icaisisas64483.2025.11051887
Privacy-preserving decentralized dual averaging push algorithms with correlated perturbations
Lü, Q., Liao, X., Li, H., Deng, S., Li, Y., & Zhang, K. (2025) · Elsevier eBooks · doi:10.1016/b978-0-44-333337-8.00013-5
Event-triggered decentralized gradient tracking algorithms for stochastic optimization in networks
Lü, Q., Liao, X., Li, H., et al. (2025) · Elsevier eBooks · doi:10.1016/b978-0-44-333337-8.00010-x
A decentralised strongly adaptive subgradient online learning algorithm over time-varying networks
Wang, G., Zhang, M., Wang, L., Zhao, X., & Zhang, Q. (2025) · International Journal of Systems Science · doi:10.1080/00207721.2025.2530672
Consensus-based primal-dual method with event-triggered communication
Hashimoto, W., Hayashi, N., Hara, N., Kawaguchi, N., Satô, T., & Takai, S. (2025) · International Journal of Control · doi:10.1080/00207179.2025.2537855 · Cited by 1
Zhang, Y., & Liu, S. (2025) · Journal of Systems Science and Complexity · doi:10.1007/s11424-025-4550-4
A System for Robot Swarm Control with a Single Remote Controller
Amelin, K., Arkhipov, I., Granichin, O. N., et al. (2025) · Mekhatronika Avtomatizatsiya Upravlenie · doi:10.17587/mau.26.471-479
Chen, S., Song, D., & He, J. (2025) · Journal of the Franklin Institute · doi:10.1016/j.jfranklin.2025.108050
Distributed Computation of Temporal Twins in Periodic Undirected Time-Varying Graphs
Tighilt, M., Azerouk, L., Palisoc, C., et al. (2025) · Lecture notes in computer science · doi:10.1007/978-3-032-00347-8_3
Qian, K., Li, Y., & Liu, X. (2025) · Chinese Control Conference (CCC) · doi:10.23919/ccc64809.2025.11179392
Differentially-Private Decentralized Learning in Heterogeneous Multicast Networks
Ziaeddini, A., Yakimenka, Y., & Kliewer, J. (2025) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit63088.2025.11195385 · Cited by 1
Decentralized Online Optimization With Compressed Communication Over Directed Graphs
Liu, H., Zhang, B., Yu, Z., Yuan, D., & Dai, M. (2025) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2025.3622106
Generalizing Differentially Private Decentralized Deep Learning with Multi-agent Consensus
Bayrooti, J., Gao, Z., & Prorok, A. (2025) · Springer proceedings in advanced robotics · doi:10.1007/978-3-032-04584-3_21 · Cited by 5
Distributed Primal-Dual Fixed Point Algorithm for Multi-Block Separable Optimization
Li, H., Lü, Q., Xia, D., Wang, X., Wang, Z., Zheng, L., Li, J. Q., & Ran, L. (2025) · Computational intelligence methods and applications · doi:10.1007/978-981-95-0911-9_3
Ogawa, G., Hayashi, N., & Inuiguchi, M. (2025) · SICE Journal of Control Measurement and System Integration · doi:10.1080/18824889.2025.2578881
Samadi, M., & Rahimi, F. (2025) · International Conference on Control, Instrumentation, and Automation · doi:10.1109/iccia69223.2025.11286067
Wang, D. (2025) · Youth Academic Annual Conference of Chinese Association of Automation (YAC) · doi:10.1109/yac66630.2025.11150342
Touat, O., Brunon, J., Belal, Y., Nicolas, J., Sabater, C., Maouche, M., & Mokhtar, S. B. (2025) · International Middleware Conference · doi:10.1145/3721462.3770770 · Cited by 5
Distributed Online Optimization With Differential Privacy Over Time-Varying Unbalanced Digraphs
Dai, M., Zhang, B., Yuan, D., & Fang, X. (2025) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2025.3643791 · Cited by 1
Makridis, E., Oliva, G., & Charalambous, T. (2025) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc57313.2025.11312648
Tang, R., Li, H., Xia, D., Ran, L., Li, J., & Zhu, W. (2026) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2026.102282
Imagining a Democratic, Affordable Future of Foundation Models: A Decentralised Avenue
He, F., Nan, L., & Zhu, T. (2025) · Springer handbooks of computational statistics · doi:10.1007/978-3-031-95418-4_16 · Cited by 1
Distributed Optimization of Multi-Agent Systems via Intermittent Gradient Information
Zhang, J., Tan, X., & Wu, Y. (2025) · Asia-Pacific Conference on Intelligent Robot Systems (ACIRS) · doi:10.1109/acirs66343.2025.11360953
Distributed Optimal Solution Manipulated via Local False Information
Zhu, W., & Hong, Y. (2026) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2026.3660188
“Remark 4: Actually, in condition (11) of parameters α , β , and γ , the relatedinformationofgraphs,suchas λ 2 (˜ LLL ) and d s ,aspriorknowledge can be obtained by agents [27], [28] since the considered graphs are fixed, where the estimation methods of algebraic connectivity can be found in [29].”
Lu, T. D., Cheng, M., Liu, H., et al. (2026) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2026.3658066
Liu, J., Wang, P., Chen, S., Cai, S., & Xu, C. (2026) · Journal of the Franklin Institute · doi:10.1016/j.jfranklin.2026.108483
An improved convergence guarantee for the gradient-push algorithm with a constant stepsize
Choi, H., Choi, W., & Kim, G. (2026) · Computational Optimization and Applications · doi:10.1007/s10589-025-00763-z · Cited by 1
Accelerating the consensus speed of complex networked system via reweighting the edges
Yuan, R., Le, Z., Zhou, M., & Liao, H. (2026) · Journal of Network and Computer Applications · doi:10.1016/j.jnca.2026.104456
Primal-Dual Strategy for Composite Optimization Over Directed Graphs
Zandi, S., Esfandiari, M., & Zhao, S. (2026) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2026.3667777
“For example, subgradient-push method, described in [30] and extensively investigated in [31], combines push-sum consensus [32] and distributed gradient descent (DGD).”
Chakrabarti, K., Mai, V. S., & Maity, D. (2026) · International Journal of Robust and Nonlinear Control · doi:10.1002/rnc.70448
How Physicality Enables Cy-Trust: A New Era of Trust-Centered Cyber–Physical Systems
Gil, S., Yemini, M., Chorti, A., Nedić, A., Poor, H. V., & Goldsmith, A. J. (2025) · Proceedings of the IEEE · doi:10.1109/jproc.2026.3660771 · Cited by 24
Self-citationRahimi, F., & Esfanjani, R. M. (2026) · International Journal of Dynamics and Control · doi:10.1007/s40435-026-02044-x
Chen, W., Wang, Z., Peng, J. C., et al. (2026) · IEEE Transactions on Industrial Informatics · doi:10.1109/tii.2026.3675917
“If μ 1 μ 2 . . . μ s < 1 with μ i > 0, then Lemma2(See[27]and[38]): Ifthecommunicationtopology is jointly connected, then there exist an integer l > 0 and a constant ρ ∈ ( 0 , 1 ) satisfying where is the double stochastic matrix, Sr ( · ) is the spectral radius, and Sr ( where λ is the optimal…”
Tang, R., Li, H., Xia, D., Ran, L., & Li, J. Q. (2026) · Nonlinear Dynamics · doi:10.1007/s11071-026-12377-z
Communication-efficient decentralized learning for intelligent networked systems
Jeong, E. (2024) · theses.fr (ABES) · doi:10.70675/bf617b44z43eaz4310zb1bdz5f5779d80456
Decentralized Federated Learning for Internet of Vehicles With Asymmetric Networks
Ji, Q., Wen, G., & Fang, X. (2026) · IEEE Transactions on Industrial Informatics · doi:10.1109/tii.2026.3677043 · Cited by 1
“According to standard convergence results for consensus protocols over asymmetric networks [36], when applied to the proposed ADMM-DFL framework, S k is bounded by O (log( 1 /η k + 1 ) + log k ) ,where η k + 1 istheconsensustolerance.”
Li, Z., & Zhang, H. (2026) · Multiagent and Grid Systems · doi:10.1177/15741702261440383
Decentralized Federated Learning With Period Gradient Tracking Over Time-Varying Networks
Shi, F., Chen, Y., Huang, Q., Huang, T., Liu, G., & Shen, L. (2026) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2026.3685244 · Cited by 1
Su, D., & Cui, L. (2026) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp55912.2026.11461354
Decentralized Learning with Dynamically Refined Edge Weights: A Data-Dependent Framework
Du, R., & Wai, H.-T. (2026) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp55912.2026.11463182
Lian, Y., Zhang, B., Yuan, D., et al. (2026) · Journal of the Franklin Institute · doi:10.1016/j.jfranklin.2026.108669
Improved Analysis of Push-DIGing for Distributed Convex Optimization over Digraphs
Mo, M., Wang, J., Liu, B., 盛子晗, & Yuan, K. (2026) · International Symposium on Big Data and Applied Statistics (ISBDAS) · doi:10.1109/isbdas69350.2026.11484962
Li, H., Ren, Y., Zhao, Z., et al. (2026) · Journal of the Franklin Institute · doi:10.1016/j.jfranklin.2026.108567
Distributed Double Accelerated Algorithm for Differentially Private Optimization
Yang, Y., He, W., Tian, Y., & Yang, Z. (2026) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2026.3691792
“Motivated by the exact convergence of subgradient-push method via diminishing stepsize[21], diminishing stepsize is applied to DGD to decay sensitivity, thus eliminating mentioned tradeoff [17], [22], [23], [24].”
Cao, Z., Wang, X., Zhang, K., Yan, D., Zhou, Y., Li, H., & Li, C. (2026) · Neurocomputing · doi:10.1016/j.neucom.2026.133872
A Fast Differentially Private Distributed Algorithm Over Unbalanced Directed Networks
Ran, M., Wang, Z. X., Lei, Y., & Li, H. (2026) · IEEE Transactions on Signal and Information Processing over Networks · doi:10.1109/tsipn.2026.3691978
“Early algorithms predominantly relied on diminishing step sizes, as seen in DGD [18] and other works [19], [20], [21], [22].”
Distributed stochastic dual averaging algorithm over time-varying networks with communication noises
Liu, J., Li, L., Yu, Z., & Ho, D. W. C. (2026) · Automatica · doi:10.1016/j.automatica.2026.113059
Distributed Online Learning for Constrained Nonseparable Problems With Privacy Preservation
Cheng, H., Li, H., Hu, J., Lü, Q., Zhao, Y., & Huang, T. (2026) · IEEE Transactions on Emerging Topics in Computational Intelligence · doi:10.1109/tetci.2026.3692603
“In [16], Lee et al. presented two distributed online dual-averaging algorithms utilizing circulation-based communication [21] and push-sum protocol [2], respectively, and further extended these approaches to stochastic optimization in [17].”
Privacy-Preserving Distributed Maximum Likelihood Estimation via State Decomposition
Paritosh, P., & Kaplan, L. (2026) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2026.3695408
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.