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 601–700 of 1,226
Quantized Distributed Nonconvex Optimization with Linear Convergence
Xu, L., Yi, X., Sun, J., Shi, Y., Johansson, K. H., & Yang, T. (2022) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc51059.2022.9992989 · Cited by 7
Xing, M., Ma, D., Zhang, H., et al. (2024) · IEEE Transactions on Systems Man and Cybernetics Systems · doi:10.1109/tsmc.2024.3458972 · Cited by 7
Coluccia, A., & Notarstefano, G. (2014) · IFAC Proceedings Volumes · doi:10.3182/20140824-6-za-1003.02596 · Cited by 7
Distributed multi-agent convex optimization over random digraphs
Alaviani, S. S., & Elia, N. (2017) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.23919/acc.2017.7963776 · Cited by 9
Li, J., Gu, C., Wu, Z., & Wu, C. (2017) · Complexity · doi:10.1155/2017/3610283 · Cited by 7
Yin, L., Zhang, B., Yu, T., et al. (2019) · IEEE Access · doi:10.1109/access.2019.2910567 · Cited by 7
On Local Computation for Network-Structured Convex Optimization in Multiagent Systems
Brown, R., Rossi, F., Solovey, K., Tsao, M., Wolf, M. T., & Pavone, M. (2021) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2021.3050129 · Cited by 8
Decentralized Constrained Optimization: Double Averaging and Gradient Projection
Shahriari-Mehr, F., Bosch, D. D., & Panahi, A. (2021) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc45484.2021.9683355 · Cited by 8
“, methods considering time-varying graphs [12], [15], local functions with a finite-sum structure [16]–[19], or compressed communication [20], [21].”
MDPGT: Momentum-Based Decentralized Policy Gradient Tracking
Jiang, Z., Lee, X. Y., Tan, S. Y., Tan, K. L., Balu, A., Lee, Y. M., Hegde, C., & Sarkar, S. (2022) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v36i9.21169 · Cited by 7
Maximal Dissent: A State-Dependent Way to Agree in Distributed Convex Optimization
Verma, A., Vasconcelos, M. M., Mitra, U., & Touri, B. (2023) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2023.3240332 · Cited by 11
Zhu, J., Xie, P., Zhang, M., Zheng, R., Xing, L., & Wu, Q. (2019) · Complexity · doi:10.1155/2019/8030792 · Cited by 7
A Distributed Optimization Algorithm over Time-Varying Graphs with Efficient Gradient Evaluations
Scoy, B. V., & Lessard, L. (2019) · IFAC-PapersOnLine · doi:10.1016/j.ifacol.2019.12.181 · Cited by 7
“See Xiao et al. (2007) for how to optimize the weights of the gossip matrix to minimize the spectral gap, and see Nedić and Olshevsky (2015) for distributed optimization over non-doubly-stochastic networks using the push-sum protocol.”
MethodSpatially Distributed Sampling and ReconstructionPreprint
Cheng, C., Jiang, Y., & Sun, Q. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1511.08541 · Cited by 7
Impact of Communication Delays on the Convergence Rate of Distributed Optimization AlgorithmsPreprint
Doan, T. T., Beck, C. L., & Srikant, R. (2017) · arXiv (Cornell University) · Cited by 8
Accelerating Convergence of Large-scale Optimization Algorithms
Ghadimi, E. (2015) · KTH Publication Database DiVA (KTH Royal Institute of Technology) · Cited by 8
Xin, R., & Khan, U. A. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1808.02942 · Cited by 7
Yi, X., Zhang, S., Yang, T., et al. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1912.12110 · Cited by 7
Accelerated Distributed Stochastic Nonconvex Optimization Over Time-Varying Directed Networks
Chen, Y., Hashemi, A., & Vikalo, H. (2024) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2024.3479888 · Cited by 17
Guo, K.-Y., Wang, Y., Luo, Y., Xiao, J., & Liu, X. (2024) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2024.3487899 · Cited by 7
Liu, B., Xie, F., & Chai, L. (2025) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2025.3546087 · Cited by 9
Su, L., Hua, Y., Li, X., et al. (2025) · IEEE Transactions on Network Science and Engineering · doi:10.1109/tnse.2025.3585153 · Cited by 6
An accelerated distributed gradient method with local memory
Ren, X., Li, D., Xi, Y., et al. (2022) · Automatica · doi:10.1016/j.automatica.2022.110260 · Cited by 6
On the Geometric Convergence of Byzantine-Resilient Distributed Optimization Algorithms
Kuwaranancharoen, K., & Sundaram, S. (2025) · SIAM Journal on Optimization · doi:10.1137/23m1573410 · Cited by 19
Shi, X., Fan, D., Wang, K., Wan, Y., & Wen, G. (2025) · International Journal of Robust and Nonlinear Control · doi:10.1002/rnc.7885 · Cited by 7
Chen, Y., Xia, W., Cao, M., et al. (2017) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2017.2756340 · Cited by 6
On the Location of the Minimizer of the Sum of Two Strongly Convex Functions
Kuwaranancharoen, K., & Sundaram, S. (2018) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2018.8619735 · Cited by 9
Fu, L., Ma, S., Kong, L., Liang, S., & Wang, X. (2018) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2018.2814779 · Cited by 6
Distributed convex optimization with coupling constraints over time-varying directed graphs†
Zhang, B., Gu, C., & Li, J. (2020) · Journal of Industrial and Management Optimization · doi:10.3934/jimo.2020061 · Cited by 9
Distributed Consensus-Based Multi-Agent Off-Policy Temporal-Difference Learning
Stanković, M. S., Beko, M., & Stankovic, S. S. (2021) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc45484.2021.9683607 · Cited by 6
A distributed optimization algorithm over Markov switching topology under adversarial attack
Du, K., Ma, Q., Kang, Y., & Wang, S. (2022) · Journal of the Franklin Institute · doi:10.1016/j.jfranklin.2022.02.019 · Cited by 6
Stochastic First-Order Methods Over Distributed Data
Qureshi, M. I., & Khan, U. A. (2022) · IEEE Sensor Array and Multichannel Signal Processing Workshop (SAM) · doi:10.1109/sam53842.2022.9827792 · Cited by 7
Communication‐aware distributed rebalancing for cooperative car‐sharing service
Hayashi, N., & Sakurama, K. (2022) · IET Control Theory and Applications · doi:10.1049/cth2.12417 · Cited by 7
Upadhyay, A., & Hashemi, A. (2023) · IEEE Access · doi:10.1109/access.2023.3288613 · Cited by 9
Iqbal, M., Qu, Z., & Gusrialdi, A. (2023) · IFAC-PapersOnLine · doi:10.1016/j.ifacol.2023.10.613 · Cited by 6
Boosting Dynamic Decentralized Federated Learning by Diversifying Model Sources
Su, D., Zhou, Y., Cui, L., & Guo, S. (2024) · IEEE Transactions on Services Computing · doi:10.1109/tsc.2024.3377157 · Cited by 7
An Empirical Bayes Approach for Distributed Estimation of Spatial Fields
Sasso, F., Coluccia, A., & Notarstefano, G. (2018) · European Control Conference (ECC) · doi:10.23919/ecc.2018.8550231 · Cited by 8
Distributed quadratic optimisation for linear multi‐agent systems over jointly connected networks
Huang, B., Zou, Y., & Meng, Z. (2019) · IET Control Theory and Applications · doi:10.1049/iet-cta.2018.5585 · Cited by 6
“Besides, the authors in [8–10] study the discrete-time distributed optimisation problem over time-varying directed graphs, while we consider a continuous-time distributed optimisation problem for linear multi-agent systems.”
BackgroundA Distributed Algorithm with Event-Triggered Communication for Resource Allocation Problem
Shi, X., Zheng, R., Yang, T., et al. (2019) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.23919/acc.2019.8814373 · Cited by 6
Dynamic Average Diffusion With Randomized Coordinate Updates
Ying, B., Yuan, K., & Sayed, A. H. (2019) · IEEE Transactions on Signal and Information Processing over Networks · doi:10.1109/tsipn.2019.2942191 · Cited by 7
Accelerated Multi-Agent Optimization Method over Stochastic Networks
Ananduta, W., Ocampo‐Martínez, C., & Nedić, A. (2020) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc42340.2020.9304307 · Cited by 8
Self-citationDistributed convex optimization via proportional-integral-differential algorithm
Zhu, W. Q., & Tian, H. (2021) · Measurement and Control · doi:10.1177/00202940211029332 · Cited by 6
Robust Consensus of Multiagent Dynamics With Transmission Constraints and Noises
Wang, X., & Su, H. (2022) · IEEE Transactions on Network Science and Engineering · doi:10.1109/tnse.2022.3147451 · Cited by 6
Localized and Incremental Probabilistic Inference for Large-Scale Networked Dynamical Systems
Matsuka, K., & Chung, S. (2023) · IEEE Transactions on Robotics · doi:10.1109/tro.2023.3297010 · Cited by 8
“While various algorithms exist in the literature [34], [35], [36], [37], the ADMM has become a popular tool as it converges for a broad class of problems [38], [39], [40].”
Consensus-Based Distributed Particle Swarm Optimization with Event-Triggered Communication
ISHIKAWA, K., Hayashi, N., & Takai, S. (2018) · IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences · doi:10.1587/transfun.e101.a.338 · Cited by 6
Distributed Event-Triggered Subgradient Method for Convex Optimization With General Step-Size
Li, R., & Mu, X. (2020) · IEEE Access · doi:10.1109/access.2020.2964324 · Cited by 5
Lookahead Converges to Stationary Points of Smooth Non-convex Functions
Wang, J., Tantia, V., Ballas, N., & Rabbat, M. (2020) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp40776.2020.9054014 · Cited by 6
Optimally Compressed Nonparametric Online Learning: Tradeoffs between memory and consistency
Koppel, A., Bedi, A. S., Rajawat, K., et al. (2020) · IEEE Signal Processing Magazine · doi:10.1109/msp.2020.2973567 · Cited by 6
“Many enhancements are possible via recent advances in decentralized optimization [21], such as those which relax conditions on the network [22] and amount of communication [23].”
BackgroundTime-varying constrained proximal type dynamics in multi-agent network games
Cenedese, C., Belgioioso, G., Grammatico, S., et al. (2020) · European Control Conference (ECC) · doi:10.23919/ecc51009.2020.9143683 · Cited by 6
On the Distributed Optimization over Directed NetworksPreprint
Xi, C., Wu, Q., & Khan, U. A. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1510.02146 · Cited by 6
“The black curve shows he convergence behavior of the subgradient-push algorithm, proosed in [15,16] .”
BackgroundCommunication-Efficient Algorithms for Decentralized and Stochastic OptimizationPreprint
Lan, G., Lee, S., & Zhou, Y. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1701.03961 · Cited by 6
Network Flows that Solve Least Squares for Linear EquationsPreprint
Liu, Y., Lou, Y., Anderson, B. D. O., et al. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1808.04140 · Cited by 6
“It is clear that (3) has exactly the same structure as the flow in [18, 19] in the sense that they are both in the form of “local averaging consensus” + “diminishing local objective”, with the difference that the flow in [18,19] is discrete-time but (3) is continuous-time.”
BackgroundMethodDistributed Zero-Order Algorithms for Nonconvex Multi-Agent OptimizationPreprint
Tang, Y., Zhang, J., & Li, N. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1908.11444 · Cited by 5
“as time-varying/undirected graphs [1, 2, 8, 5, 9, 10], uncoordinated step sizes [11, 12], stochastic (sub)gradient [13, 14], etc.”
BackgroundLei, J., & Shanbhag, U. V. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1811.11246 · Cited by 5
A Survey of Distributed Optimization Methods for Multi-Robot SystemsPreprint
Halsted, T., Shorinwa, O., Yu, J., & Schwager, M. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2103.12840 · Cited by 71
Quantized Distributed Gradient Tracking Algorithm with Linear Convergence in Directed NetworksPreprint
Xiong, Y., Wu, L., You, K., et al. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2104.03649 · Cited by 6
Push-Sum on Random Graphs: Almost Sure Convergence and Convergence Rate
Rezaeinia, P., Gharesifard, B., Linder, T., & Touri, B. (2019) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2019.2929206 · Cited by 36
A stochastic gradient tracking algorithm with adaptive momentum for distributed optimization
Li, Y., Hu, H., Zhang, K., Lü, Q., Deng, S., & Li, H. (2025) · Neurocomputing · doi:10.1016/j.neucom.2025.130095 · Cited by 5
Xu, L., Yi, X., Sun, J., Shi, Y., Johansson, K. H., & Yang, T. (2025) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2025.3563431 · Cited by 11
Sparse Decentralized Federated Learning
Sha, S., Zhou, S., Kong, L., & Li, G. Y. (2025) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2025.3603005 · Cited by 5
Delay-tolerant augmented-consensus-based distributed directed optimization
Doostmohammadian, M., Narahari, K. R., & Aghasi, A. (2025) · Systems & Control Letters · doi:10.1016/j.sysconle.2025.106260 · Cited by 9
Distributed convex optimization as a tool for solving f -consensus problems
Huang, C., Anderson, B. D. O., Zhang, H., et al. (2023) · Automatica · doi:10.1016/j.automatica.2023.111087 · Cited by 5
Distributed optimisation algorithm based on iterative learning control
Dong, X., Zhang, R., Chen, X., & Xue, L. (2024) · International Journal of Systems Science · doi:10.1080/00207721.2024.2388810 · Cited by 5
Distributed ADMM With Linear Updates Over Directed Networks
Rokade, K., & Kalaimani, R. K. (2025) · IEEE Transactions on Network Science and Engineering · doi:10.1109/tnse.2025.3529703 · Cited by 14
Herrera, D. P., Chen, Z., & Larsson, E. G. (2025) · IEEE Open Journal of the Communications Society · doi:10.1109/ojcoms.2025.3540133 · Cited by 13
Distributed Average Consensus in Open Multi-Agent Systems
Hadjicostis, C. N., & Domínguez-García, A. D. (2024) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc56724.2024.10886031 · Cited by 5
Constrained multi-cluster game: Distributed Nash equilibrium seeking over directed graphs
Nguyen, D. T., Bianchi, M., Dörfler, F., Nguyen, D. T., & Nedić, A. (2024) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc56724.2024.10885852 · Cited by 6
Self-citationMeso-scale coalitional control in large-scale networks
Erofeeva, V., Granichin, O. N., & Uzhva, D. (2025) · Automatica · doi:10.1016/j.automatica.2025.112276 · Cited by 5
A Cutting-Surface Consensus Approach for Distributed Robust Optimization of Multi-Agent Systems
Fu, J., & Wu, X. (2025) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2025.3573763 · Cited by 5
Hu, H., Zhu, Q., & Hou, M. (2025) · IEEE Transactions on Systems Man and Cybernetics Systems · doi:10.1109/tsmc.2025.3570640 · Cited by 5
A forward-backward Bregman splitting scheme for regularized distributed optimization problems
Xu, J., Zhu, S., Soh, Y. C., & Xie, L. (2016) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2016.7798413 · Cited by 5
Song, Q., Xie, Y., & Lin, Z. (2022) · International Journal of Robust and Nonlinear Control · doi:10.1002/rnc.6220 · Cited by 5
Zhao, D., Liu, D., & Cao, X. (2022) · IEEE Internet of Things Journal · doi:10.1109/jiot.2022.3227041 · Cited by 4
“Lemma 1 [28]: Let {s(k)}, {r(k)}, {y(k)}, and {f (k)} are nonnegative sequences.”
Subgradient-Push Is of the Optimal Convergence Rate
Lin, Y., & Liu, J. (2022) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc51059.2022.9992842 · Cited by 8
GradConsensus: Linearly Convergent Algorithm for Reducing Disagreement in Multi-Agent Optimization
Khatana, V., Saraswat, G., Patel, S., & Salapaka, M. V. (2023) · IEEE Transactions on Network Science and Engineering · doi:10.1109/tnse.2023.3321757 · Cited by 7
“Subsequently, the authors in [13] incorporated the push-sum protocol [14] with the earlier DGD method [3] to propose the subgradient-push algorithm for time-varying directedgraphs.”
BackgroundMethodZeroth-order Gradient Tracking for Distributed Constrained Optimization
Cheng, S., Yu, X., Fan, Y. C., et al. (2023) · IFAC-PapersOnLine · doi:10.1016/j.ifacol.2023.10.115 · Cited by 5
Reducing Training Time in Cross-Silo Federated Learning using Multigraph Topology
Do, T., Nguyen, B. X., Pham, V., Toàn, T. K., Tjiputra, E., Tran, Q. D., & Nguyen, A. (2023) · IEEE/CVF International Conference on Computer Vision (ICCV) · doi:10.1109/iccv51070.2023.01778 · Cited by 11
Provably Accelerated Decentralized Gradient Methods Over Unbalanced Directed Graphs
Song, Z., Shi, L., Pu, S., & Yan, M. (2024) · SIAM Journal on Optimization · doi:10.1137/22m148570x · Cited by 11
MUSIC: Accelerated Convergence for Distributed Optimization With Inexact and Exact Methods
Wu, M., Liao, H., Ding, Z., & Xiao, Y. (2024) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2024.3376421 · Cited by 8
Distributed Heavy-Ball Over Time-Varying Digraphs With Barzilai-Borwein Step Sizes
Yang, S., Shen, Y. ‐., Cao, J., & Huang, T. (2024) · IEEE Transactions on Emerging Topics in Computational Intelligence · doi:10.1109/tetci.2024.3382232 · Cited by 6
Qin, Y., Lu, K., & Wang, H. (2024) · IEEE Transactions on Network Science and Engineering · doi:10.1109/tnse.2024.3409061 · Cited by 5
Distributed stochastic optimization under imperfect information
Kannan, A., Nedić, A., & Shanbhag, U. V. (2015) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2015.7402233 · Cited by 6
Self-citationDistributed optimization for multiagent systems over general strongly connected digraph
Wang, D., Wang, Z., Wang, D., & Wang, W. (2017) · Chinese Control Conference (CCC) · doi:10.23919/chicc.2017.8028724 · Cited by 5
Distributed Multi-Objective Optimization over Randomly Varying Unbalanced Networks
Wada, T., Masubuchi, I., Hanada, K., Asai, T., & Fujisaki, Y. (2017) · IFAC-PapersOnLine · doi:10.1016/j.ifacol.2017.08.434 · Cited by 8
Kajiyama, Y., Hayashi, N., & Takai, S. (2017) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2017.8264346 · Cited by 6
Distributed Deterministic Asynchronous Algorithms in Time-Varying Graphs Through Dykstra Splitting
Pang, C. H. J. (2019) · SIAM Journal on Optimization · doi:10.1137/18m1168297 · Cited by 5
Distributed Economic Dispatch using Framework for Network Co-simulation
Mana, P. T., & Hansen, J. (2018) · IEEE Power & Energy Society General Meeting (PESGM) · doi:10.1109/pesgm.2018.8585971 · Cited by 5
Randomized Block Proximal Methods for Distributed Stochastic Big-Data Optimization
Farina, F., & Notarstefano, G. (2020) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2020.3027647 · Cited by 12
Jin, K., Lu, Q., & Yin, K. (2020) · Chinese Control Conference (CCC) · doi:10.23919/ccc50068.2020.9188895 · Cited by 5
Penalty-Based Method for Decentralized Optimization over Time-Varying Graphs
Rogozin, A., & Gasnikov, A. V. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-62867-3_18 · Cited by 6
Distributed Constrained Optimization with Linear Convergence Rate
Dong, Z., Mao, S., Du, W., & Tang, Y. S. (2020) · International Conference on Control and Automation · doi:10.1109/icca51439.2020.9264327 · Cited by 6
“, communication limitations [3] [9] [10] [11] and applications in distributed energy resources”
BackgroundLuan, L., & Qin, S. (2022) · Neural Computing and Applications · doi:10.1007/s00521-022-07399-8 · Cited by 5
“[47] Timevarying None Unconstrained distributed optimization problem Each agent knows its local out-degree 3Nnþ N”
BackgroundA Decentralized Stochastic Algorithm for Coupled Composite Optimization With Linear Convergence
Lü, Q., Liao, X., Deng, S., & Li, H. (2022) · IEEE Transactions on Signal and Information Processing over Networks · doi:10.1109/tsipn.2022.3190743 · Cited by 8
A Modified Gradient Flow for Distributed Convex Optimization on Directed Networks
Jahvani, M., & Guay, M. (2022) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.23919/acc53348.2022.9867634 · Cited by 5
Distributed object pose estimation over strongly connected networks
Lee, J., Tran, Q. V., Oh, K.-H., Park, P., & Ahn, H. (2023) · Systems & Control Letters · doi:10.1016/j.sysconle.2023.105505 · Cited by 7
Farakhor, A., Wang, Y., Wu, D. X., et al. (2023) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.23919/acc55779.2023.10156008 · Cited by 5
Improved Mixing Rates of Directed Cycles by Added Connection
Gerencsér, B. S., & Hendrickx, J. M. (2018) · Journal of Theoretical Probability · doi:10.1007/s10959-018-0861-x · Cited by 5
Xie, T., Chen, G., & Liao, X. (2019) · Neural Computing and Applications · doi:10.1007/s00521-019-04116-w · Cited by 6
“Moreover, compared with other existing methods [17, 29], this heterogeneous time-varying step-sizes have a wider range; (iii) theoretical analysis demonstrates that EV-ADOA can linearly converge to the optimal solution when the upper bound of the heterogeneous step-sizes is smaller than a certain…”
BackgroundMethodResultInfluentialGu, C., Wu, Z., & Li, J. (2019) · Numerical Algorithms · doi:10.1007/s11075-019-00746-2 · Cited by 6
On the Convergence Rate of Average Consensus and Distributed optimization over Unreliable Networks
Su, L. (2018) · Asilomar Conference on Signals, Systems and Computers (ACSSC) · doi:10.1109/acssc.2018.8645184 · Cited by 10
Distributed Optimization Over Time-Varying Networks With Minimal Connectivity
Wu, X., & Lu, J. (2020) · IEEE Control Systems Letters · doi:10.1109/lcsys.2020.2971835 · Cited by 5
“Remark 1: Assumption 2 generalizes the standard B-connectivity [4]–[10], which says that there exists a positive integer B such that (V,∪(k+1)B−1 t=kB E t) is connected for any k ≥ 0.”
BackgroundResultInfluential
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.