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 701–800 of 1,226
Yang, L., Qin, Z., Zhang, F., et al. (2020) · doi:10.1145/3386762.3386773 · Cited by 5
Approximate projections for decentralized optimization with SDP constraints
Lee, S., & Zavlanos, M. M. (2016) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2016.7798403 · Cited by 5
Random asynchronous iterations in distributed coordination algorithms
Chen, Y., Xia, W., Cao, M., et al. (2019) · Automatica · doi:10.1016/j.automatica.2019.108505 · Cited by 5
Augmented distributed optimization for networked systems
Xu, J. (2019) · doi:10.32657/10356/68805 · Cited by 5
Fast and Stable Nonconvex Constrained Distributed Optimization: The ELLADA AlgorithmPreprint
Tang, W., & Daoutidis, P. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2004.01977 · Cited by 5
Compressed Gradient Tracking for Decentralized Optimization with Linear Convergence.Preprint
Li, Z., Liao, Y., Huang, K., & Pu, S. (2021) · arXiv (Cornell University) · Cited by 3
Differentially Private Distributed Nash Equilibrium Seeking Over Time-Varying Digraphs
Chen, Y., & Ma, Q. (2025) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2025.3590450 · Cited by 4
“Remark 2: From [27], [ B ( l : 0) 1 N ] i > ¯ δ can be obtained, where ¯ δ is the positive constant, 1 N is the N -dimensional column vector with all elements equal to 1, and B ( l : 0) is defined in the second paragraph of Section IV.”
Hu, H., Zhu, Q., & Hou, M. (2025) · Nonlinear Dynamics · doi:10.1007/s11071-025-11592-4 · Cited by 4
Distributed online constrained nonconvex optimization in dynamic environments over directed graphs
Suo, W., Li, W., Yang, L. S., et al. (2024) · Signal Processing · doi:10.1016/j.sigpro.2024.109827 · Cited by 4
An Analysis Tool for Push-Sum-Based Distributed Optimization
Lin, Y., Zhu, Z., & Liu, J. (2025) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2025.3596669 · Cited by 5
A Decentralized Variance-Reduced Method for Stochastic Optimization Over Directed Graphs
Qureshi, M. I., Xin, R., Kar, S., & Khan, U. A. (2021) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp39728.2021.9413600 · Cited by 5
A Markovian Incremental Stochastic Subgradient Algorithm
de Oliveira, R. M., Costa, E. F., & Helou, E. S. (2021) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2021.3137274 · Cited by 4
A distributed parallel optimization algorithm via alternating direction method of multipliers
Liu, Z., Guo, F., Wang, W., & Wu, X. (2023) · IET Control Theory and Applications · doi:10.1049/cth2.12421 · Cited by 7
An event-triggering algorithm for decentralized stochastic optimization over networks
Li, Y., Chen, Y., Lü, Q., et al. (2023) · Journal of the Franklin Institute · doi:10.1016/j.jfranklin.2023.07.006 · Cited by 4
Zhang, J., Liu, L., Wang, X., et al. (2023) · International Journal of Robust and Nonlinear Control · doi:10.1002/rnc.6887 · Cited by 4
Distributed asynchronous non-smooth optimization with coupled equality and bounded constraints
Lin, W.-T., & Li, C. (2023) · Neural Computing and Applications · doi:10.1007/s00521-023-09205-5 · Cited by 4
Asynchronous ADMM via a Data Exchange Server
Pan, Z., & Cannon, M. (2024) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2024.3354840 · Cited by 6
A Novel Single-Time Scale Distributed Attack-Resilient Algorithm for Multi-Cluster Games
Li, F., Liu, D., & Nian, X. (2024) · IEEE Transactions on Network Science and Engineering · doi:10.1109/tnse.2024.3409353 · Cited by 4
Fully Distributed Event-Triggered Nash Equilibrium Seeking for Networked Mean Field Games
Jia, L., Yu, D., Cheong, K. H., et al. (2024) · IEEE Transactions on Systems Man and Cybernetics Systems · doi:10.1109/tsmc.2024.3489662 · Cited by 4
Distributed aggregative optimization over directed networks with column-stochasticity
Zhou, Q., Zhang, K., Zhou, H., Lü, Q., Liao, X., & Li, H. (2024) · Journal of the Franklin Institute · doi:10.1016/j.jfranklin.2024.107492 · Cited by 5
Two-Group Distributed Optimization Under Cooperative-Collaborative Networks With Linear Convergence
Dong, Z., Mao, S., Du, W., Jin, Y., & Tang, Y. S. (2025) · IEEE Transactions on Circuits and Systems I Regular Papers · doi:10.1109/tcsi.2024.3524548 · Cited by 4
Chen, M., Wang, D., Xu, X., et al. (2025) · IEEE Transactions on Artificial Intelligence · doi:10.1109/tai.2025.3535458 · Cited by 4
Asynchronous Agreement through Distributed Coordination Algorithms Associated with Periodic Matrices
Qin, Y., Cao, M., & Anderson, B. D. O. (2017) · IFAC-PapersOnLine · doi:10.1016/j.ifacol.2017.08.502 · Cited by 4
A Randomized Block Subgradient Approach to Distributed Big Data Optimization
Farina, F., & Notarstefano, G. (2019) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc40024.2019.9030156 · Cited by 4
Hu, H., & Mo, L. (2021) · Chinese Control Conference (CCC) · doi:10.23919/ccc52363.2021.9549864 · Cited by 4
“Reference [5] designed a fixed-step distributed subgradient algorithm for multi-agent system to solve the unconstrained optimization problem and the good result also was extended to directed graphs [6].”
MethodAn accelerated distributed online gradient push‐sum algorithm on time‐varying directed networks
Fang, R., Li, D., Shen, X., et al. (2021) · Asian Journal of Control · doi:10.1002/asjc.2721 · Cited by 4
Formation control of non-identical multi-agent systems
Djamari, D. W., Fikri, M. R., Budiman, B. A., et al. (2022) · International Journal of Power Electronics and Drive Systems/International Journal of Electrical and Computer Engineering · doi:10.11591/ijece.v12i3.pp2721-2732 · Cited by 4
Hayashi, N., & Nagahara, M. (2022) · Advanced Robotics · doi:10.1080/01691864.2022.2099764 · Cited by 4
Decentralized Parallel SGD Based on Weight-Balancing for Intelligent IoV
Yuan, Y., Yu, J., Cheng, X., Zou, Z., Yu, D., & Cai, Z. (2022) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2022.3216709 · Cited by 4
Robust decentralized stochastic gradient descent over unstable networks
Zheng, Y., Zhang, L., Chen, S., Zhang, X., Cai, Z., & Cheng, X. (2023) · Computer Communications · doi:10.1016/j.comcom.2023.02.025 · Cited by 5
Inoue, K., Hayashi, N., & Takai, S. (2023) · IEEE Access · doi:10.1109/access.2023.3305529 · Cited by 4
Distributed online optimisation in unknown dynamic environment
Wang, S., & Huang, B. (2024) · International Journal of Systems Science · doi:10.1080/00207721.2024.2302903 · Cited by 4
Berahas, A. S., Bollapragada, R., & Gupta, S. (2024) · Journal of Optimization Theory and Applications · doi:10.1007/s10957-024-02554-8 · Cited by 18
Multiagent Distributed Optimization
Rabbat, M., & Ribeiro, A. (2018) · Elsevier eBooks · doi:10.1016/b978-0-12-813677-5.00005-5 · Cited by 4
BYRDIE: A BYZANTINE-RESILIENT DISTRIBUTED LEARNING ALGORITHM
Yang, Z., & Bajwa, W. U. (2018) · IEEE Data Science Workshop (DSW) · doi:10.1109/dsw.2018.8439115 · Cited by 4
Belief Control Strategies for Interactions Over Weakly-Connected Graphs
Salami, H., Ying, B., & Sayed, A. H. (2021) · IEEE Open Journal of Signal Processing · doi:10.1109/ojsp.2021.3081026 · Cited by 4
Hayashi, N., ISHIKAWA, K., & Takai, S. (2020) · IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences · doi:10.1587/transfun.2019map0007 · Cited by 4
Privacy-Preserving Distributed Coordination of Distributed Energy Resources
Zholbaryssov, M., Hadjicostis, C. N., & Domínguez-García, A. D. (2020) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc42340.2020.9303977 · Cited by 6
Stanković, M. S., Beko, M., & Stanković, S. S. (2020) · IFAC-PapersOnLine · doi:10.1016/j.ifacol.2020.12.2184 · Cited by 4
A Distributed Proximal-Gradient Based Algorithm for N-Coalition Games of Mixed-Order Players
Ma, T., Hu, C., Hu, X., et al. (2022) · IEEE Transactions on Circuits & Systems II Express Briefs · doi:10.1109/tcsii.2022.3149749 · Cited by 4
“Remark 1: Here, we consider the mixed-order dynamics in the N-coalition games, where the problem (2) covers the well-known Generalized Nash Equilibrium seeking problem (GNEP) (N ≥ 2, mi = 1) [4]–[6] and the distributed optimization problem (N = 1, m1 ≥ 2) [14]–[16].”
BackgroundPrimal-Dual Method for Optimization Problems with Changing Constraints
Васильевич, К. И. (2022) · Lecture notes in computer science · doi:10.1007/978-3-031-09607-5_4 · Cited by 2
Distributed Optimization for Mixed-Integer Consensus in Multi-Agent Networks
Liu, Z., & Stursberg, O. (2022) · European Control Conference (ECC) · doi:10.23919/ecc55457.2022.9838543 · Cited by 4
Constrained Online Learning in Networks with Sublinear Regret and Fit
Paternain, S., Lee, S., Zavlanos, M. M., & Ribeiro, A. (2019) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc40024.2019.9030193 · Cited by 4
Decentralized multi-agent optimization based on a penalty method
Васильевич, К. И. (2021) · Optimization · doi:10.1080/02331934.2021.1950151 · Cited by 4
Distributed Subgradient Projection Algorithm over Directed GraphsPreprint
Xi, C., & Khan, U. A. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1602.00653 · Cited by 4
Distributed Optimization of Nonconvex Functions over Time-Varying GraphsPreprint
Scoy, B. V., & Lessard, L. (2019) · arXiv (Cornell University) · Cited by 4
NEXT: In-Network Nonconvex OptimizationPreprint
Lorenzo, P. D., & Scutari, G. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1602.00591 · Cited by 4
“Algorithms belonging to the former class include: i) consensus-based (sub)gradient schemes [1]–[4] along with their accelerated and asynchronous versions [5]–[7]; ii) the (sub)gradient push-method [8], [9]; iii) the dual-average method [10], [11]; and iv) distributed secondorder-based schemes [12], [13].”
MethodRan, L., Li, H., Wang, Z., Zheng, L., Li, J., & Li, Z. (2025) · Neurocomputing · doi:10.1016/j.neucom.2025.131608 · Cited by 4
Zhao, Z., Liu, Z., Zhang, C., & Wei, M. (2025) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2025.3585176 · Cited by 12
Online distributed optimization with clipped stochastic gradients: High probability bound of regrets
Yang, Y. C., Lu, K., & Wang, L. (2025) · Automatica · doi:10.1016/j.automatica.2025.112525 · Cited by 13
Suo, W., Li, W., Zhang, B., et al. (2025) · IEEE Transactions on Systems Man and Cybernetics Systems · doi:10.1109/tsmc.2025.3613348 · Cited by 3
Distributed heavy-ball algorithm of Nash equilibrium seeking for aggregative games
Yang, X., & Ni, W. (2022) · Journal of Control and Decision · doi:10.1080/23307706.2022.2032418 · Cited by 3
Basco, V. (2023) · Systems & Control Letters · doi:10.1016/j.sysconle.2023.105681 · Cited by 4
Event-Triggered Distributed Estimation With Inter-Event Information Retrieval
Lao, X., & Li, C. (2024) · IEEE Transactions on Signal and Information Processing over Networks · doi:10.1109/tsipn.2024.3375605 · Cited by 3
“For inter-nodes communications, some works consider undirected communication links, and there are also works handling directed or time-varying links [10], [11].”
BackgroundForgetting-Factor Regret for Distributed Online Optimization
Li, J., Mo, L., Shang, J., et al. (2024) · Chinese Control Conference (CCC) · doi:10.23919/ccc63176.2024.10662158 · Cited by 3
Distributed Stochastic Learning for Composite Sharing Optimization in Consumer Electronics
Lü, Q., Dai, X., Zhang, W., & Ezilarasan, M. R. (2024) · IEEE Transactions on Consumer Electronics · doi:10.1109/tce.2024.3506915 · Cited by 3
Liu, J., Peng, Y., Zhang, X., Ning, Z., & Fan, D. (2025) · Technologies · doi:10.3390/technologies13080327 · Cited by 4
Open Distributed Convex Optimization
Wu, X., Lin, J., Jiang, S., et al. (2025) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2025.3608057 · Cited by 3
Networked Parallel Algorithms for Robust Convex Optimization via the Scenario Approach
You, K., & Tempo, R. (2018) · Lecture notes in control and information sciences - proceedings · doi:10.1007/978-3-319-67068-3_25 · Cited by 4
Distributed Learning from Interactions in Social Networks
Sasso, F., Coluccia, A., & Notarstefano, G. (2018) · European Control Conference (ECC) · doi:10.23919/ecc.2018.8550320 · Cited by 3
Convergence Rate of Push-Sum Algorithms on Random Graphs
Rezaienia, P., Gharesifard, B., Linder, T., & Touri, B. (2018) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2018.8618933 · Cited by 2
Distributed stochastic nonsmooth nonconvex optimization
Kungurtsev, V. (2022) · Operations Research Letters · doi:10.1016/j.orl.2022.09.001 · Cited by 4
Distributed Optimization With Uncertain Communications
Rezaeinia, P., Gharesifard, B., & Linder, T. (2024) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2024.3495456 · Cited by 2
Decentralized cooperative control with connectivity maintenance for multiagent systems
Fan, X., Yang, X., & Li, G. (2019) · International Robotics & Automation Journal · doi:10.15406/iratj.2019.05.00163 · Cited by 3
“Where Inc is an increment quantity, we select Inc = 0:25, for all i = [1; 2; 3; 4; 5; 6; 7].”
BackgroundShi, Z., & Zhou, C. (2020) · Optimal Control Applications and Methods · doi:10.1002/oca.2643 · Cited by 3
“From (23) and (24), we obtain: ||xi k − x||2 ≤ ||vik − x||2 + α2 i,k ⋅ ||∇fi(vik)||2 − 2 k ⋅ pi ⋅ ∇f T i (vk) ⋅ (vk − x) + ak ⋅ (||∇f T i (vik)||2 + ||vik − x||2) ≤ (1 + ak) ⋅ ||vik − x||2 + (α2 i,k + ak) ⋅ ||∇f T i (vik)||2 − 2 k ⋅ pi ⋅ ∇f T i (vk) ⋅ (vk − x).”
Convex Decreasing Algorithms: Distributed Synthesis and Finite-Time Termination in Higher Dimension
Melbourne, J., Saraswat, G., Khatana, V., Patel, S., & Salapaka, M. V. (2023) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2023.3344721 · Cited by 5
“However, increasing storage and computation capabilities of modern day sensor interfacing technologies have motivated largescale applications, examples of which include distributed machine learning, see [9], multi-agent control and co-ordination, see [10], [11], distributed optimization problems, see [12], [13], distr…”
BackgroundA Heavy-Ball Distributed Optimization Algorithm over Digraphs with Row-Stochastic Matrices
Shen, Y., & Yang, S. (2020) · Chinese Control Conference (CCC) · doi:10.23919/ccc50068.2020.9188385 · Cited by 4
“Lemma 2 (see [25]).”
Distributed Optimisation with Stochastic Event-Triggered Multi-Agent Control Algorithm
Tsang, K. F. E., Wu, J., & Shi, L. (2020) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc42340.2020.9303799 · Cited by 3
Event-triggered Finite-time Consensus under Directed Graphs
Jin, X., Zhang, W., Wu, X., & Tang, Y. S. (2020) · IFAC-PapersOnLine · doi:10.1016/j.ifacol.2020.12.2325 · Cited by 3
Accelerated Gradient Flow for Directed Graphs With Event-Based Broadcasting
Dhullipalla, M. H., Yu, H., & Chen, T. (2023) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2023.3290112 · Cited by 3
“Furthermore, for general digraphs, algorithms typically employ additional in-formationsuchas:1)knowledgeoftheout-degree,see[30],[31], 2)lefteigenvectorsof L dir , see [17], or 3) estimates of left eigenvectors of L dir , see [18].”
BackgroundZhou, Y., Ai, W., Tang, G., & Chen, H. (2023) · Applied Intelligence · doi:10.1007/s10489-023-04765-4 · Cited by 3
Distributed mirror descent algorithm over unbalanced digraphs based on gradient weighting technique
Shi, C., & Yang, G. (2023) · Journal of the Franklin Institute · doi:10.1016/j.jfranklin.2023.08.009 · Cited by 4
Fully Distributed Continuous-Time Algorithm for Nonconvex Optimization Over Unbalanced Digraphs
Zhang, J., Hao, Y., Liu, L., Wang, X., & Ji, H. (2023) · International Conference on Control, Decision and Information Technologies (CoDIT) · doi:10.1109/codit58514.2023.10284207 · Cited by 3
Liu, Z., Wang, W., & Guo, F. (2023) · Annual Conference of the IEEE Industrial Electronics Society (IECON) · doi:10.1109/iecon51785.2023.10312089 · Cited by 3
Federated Learning in Wireless Networks via Over-the-Air Computations
Öksüz, H. Y., Molinari, F., Sprekeler, H., & Raisch, J. (2023) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc49753.2023.10384001 · Cited by 5
Ran, L., Li, H., Hu, J., Lü, Q., Wang, Z., Li, Z., & Chen, G. (2024) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2023.3285865 · Cited by 4
“To solve the prominent distributed optimization problem, i.e., min x ∈ R n (cid:2) =1 F i ( x ) , the work [20] first uses the consensus theory to design a distributed subgradient method, and subsequent work [21] further studies its variation under time-varying networks.”
MethodKubicek, K., Čech, M., & Střelec, M. (2024) · Applied Sciences · doi:10.3390/app14051991 · Cited by 3
Lyapunov based stochastic stability of a quantum decision system for human–machine interaction
Snow, L., Jain, S., & Krishnamurthy, V. (2024) · Automatica · doi:10.1016/j.automatica.2024.111628 · Cited by 6
Gu, M., Yu, Z., & Jiang, H. (2024) · Optimal Control Applications and Methods · doi:10.1002/oca.3128 · Cited by 3
Safe Pricing Mechanisms for Distributed Resource Allocation With Bandit Feedback
Hutchinson, S., Turan, B., & Alizadeh, M. (2024) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2024.3372143 · Cited by 3
Low Complexity Convergence Rate Bounds for the Synchronous Gossip Subclass of Push-Sum Algorithms
Gerencsér, B. S., & Kornyik, M. (2024) · IEEE Control Systems Letters · doi:10.1109/lcsys.2024.3407997 · Cited by 4
Kernel-Based Decentralized Policy Evaluation for Reinforcement Learning
Liu, J., & Lian, H. (2024) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2024.3453036 · Cited by 3
Luan, M., Wen, G., & Yang, T. (2024) · International Journal of Robust and Nonlinear Control · doi:10.1002/rnc.7666 · Cited by 3
R-DOCO: Resilient Distributed Online Convex Optimization Against Adversarial Attacks
Kong, Z., Xu, H., & Pan, C. (2024) · Mathematics · doi:10.3390/math12213439 · Cited by 3
Communication-Efficient Distributed Bayesian Federated Learning Over Arbitrary Graphs
Wang, S., Guo, H., Zhu, X., Yin, C., & Lau, V. K. N. (2025) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2025.3546328 · Cited by 5
A Distributed Model Predictive Control Algorithm of Linear Systems Over Time-Varying Directed Graphs
Jin, B., Li, H., & Yan, W. (2019) · Chinese Control Conference (CCC) · doi:10.23919/chicc.2019.8865206 · Cited by 3
Optimales Energie-Management über verteilte, beschränkte Gradientenverfahren
Zimmermann, J., Tatarenko, T., Willert, V., & Adamy, J. (2019) · at - Automatisierungstechnik · doi:10.1515/auto-2019-0064 · Cited by 3
“[8] verwendet das Push-Sum-Konsensus-Protokoll zur Berechnung von verteilten Informationen und beweist, dass eine Konvergenz auf ein Optimum auch bei zeitlichen Änderungen der Kommunikationsverbindungenmöglich ist.”
BackgroundInfluentialDistributed Learning with Non-Smooth Objective Functions
Gratton, C., Venkategowda, N. K. D., Arablouei, R., et al. (2020) · European Signal Processing Conference (EUSIPCO) · doi:10.23919/eusipco47968.2020.9287441 · Cited by 3
A Distributed Proximal Primal-Dual Algorithm for Nonsmooth Optimization with Coupling Constraints
Wu, X., Wang, H., & Lu, J. (2020) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc42340.2020.9303937 · Cited by 2
On local analysis of distributed optimization
Tatarenko, T., & Touri, B. (2016) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.1109/acc.2016.7526552 · Cited by 3
Distributed belief averaging using sequential observations
Liu, Y., Liu, J., Başar, T., & Liu, M. (2017) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.23919/acc.2017.7963031 · Cited by 2
Distributed Event-Triggered Subgradient Method for Convex Optimization with a Common Constraint Set
Kajiyama, Y., Hayashi, N., & Takai, S. (2017) · IFAC-PapersOnLine · doi:10.1016/j.ifacol.2017.08.2449 · Cited by 3
An Approximately-Zero-Gradient-Sum Algorithm for Consensus Optimization
Wei, H., Qu, Z., Wu, X., Wang, H., & Lu, J. (2018) · International Conference on Control, Automation, Robotics and Vision (ICARCV) · doi:10.1109/icarcv.2018.8581380 · Cited by 2
“, [2], [3], [4], [5], [6], [7], [8], [9], [10], [11]).”
Microgrid Distributed Frequency Control Over Time-Varying Communication Networks
Zholbaryssov, M., & Domínguez-García, A. D. (2018) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2018.8619398 · Cited by 4
Fast Decentralized Data Analytics in IoT Wireless Networks
Zhao, L. (2019) · IEEE Access · doi:10.1109/access.2019.2960494 · Cited by 3
Randomised block‐coordinate Frank‐Wolfe algorithm for distributed online learning over networks
Li, J., Wu, Q., Zheng, R., Zhu, J., Ge, Q., & Zhang, M. (2020) · Cognitive Computation and Systems · doi:10.1049/ccs.2020.0007 · Cited by 2
Lan, G., Ouyang, Y., & Zhou, Y. (2023) · SIAM Journal on Optimization · doi:10.1137/20m138956x · Cited by 11
A Multi-Scale Method for Distributed Convex Optimization with Constraints
Ni, W., & Wang, X. (2022) · Journal of Optimization Theory and Applications · doi:10.1007/s10957-021-01982-0 · Cited by 4
Finite-time error bounds for distributed linear stochastic approximation
Lin, Y., Gupta, V., & Liu, J. (2023) · Automatica · doi:10.1016/j.automatica.2023.111368 · Cited by 6
“Almost all, if not all, the existing push-based distributed optimization works build on the analysis in [53]; however, that analysis assumes that a convex combination of the entire history of the states of each agent (and not merely the current state of the agent) is being calculated.”
BackgroundMethodInfluentialDistributed Optimization on Directed Graphs Based on Inexact ADMM with Partial Participation
Yi, D., & Freris, N. M. (2023) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc49753.2023.10384030 · Cited by 3
“A sublinear convergence is established [13], [14] even for strongly convex problems, while linear convergence can be retrieved using gradient tracking [15].”
Background
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.