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 301–400 of 1,226
Distributed consensus-based multi-agent convex optimization via gradient tracking technique
Li, H., Zhang, H., Wang, Z., Zhu, Y., & Han, Q. (2019) · Journal of the Franklin Institute · doi:10.1016/j.jfranklin.2019.01.050 · Cited by 23
Distributed Learning for Cooperative InferencePreprint
Nedić, A., Olshevsky, A., & Uribe, C. A. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1704.02718 · Cited by 26
Self-citationWang, F., Zhang, C., Yang, Y., & Li, N. (2023) · Chaos Solitons & Fractals · doi:10.1016/j.chaos.2023.113332 · Cited by 22
Luan, M., Wen, G., Lv, Y., et al. (2023) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2023.3347328 · Cited by 22
Gong, P., Wang, Q., & Ahn, C. K. (2024) · IEEE Transactions on Automation Science and Engineering · doi:10.1109/tase.2024.3452472 · Cited by 22
Distributed dynamic optimization over directed graphs
Xi, C., & Khan, U. A. (2016) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2016.7798277 · Cited by 21
Annealing for Distributed Global Optimization
Swenson, B., Kar, S., Poor, H. V., & Moura, J. M. F. (2019) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc40024.2019.9029708 · Cited by 27
Research status and prospects of distributed collaborative optimization
Chai, T., & Yang, T. (2020) · Scientia Sinica Technologica · doi:10.1360/sst-2020-0040 · Cited by 23
Primal–Dual Fixed Point Algorithms Based on Adapted Metric for Distributed Optimization
Li, H., Zheng, Z., Lü, Q., Wang, Z., Gao, L., Wu, G., Ji, L., & Wang, H. (2021) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2021.3110295 · Cited by 23
“Subsequent works have investigated variations considering acceleration [27], in time-varying networks [28], [29], and in stochastic setting [30].”
BackgroundA Family of Distributed Momentum Methods Over Directed Graphs With Linear Convergence
Gao, J., Liu, X., Dai, Y., Huang, Y., & Yang, P. (2022) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2022.3160684 · Cited by 24
“The method in [15] achieved sublinear convergence for convex functions, while the methods in [16]–[23] have linear convergence rates for smooth and strongly convex functions.”
BackgroundMethodInfluentialLin, W.-T., Chen, G., & Zhou, X. (2022) · Energy · doi:10.1016/j.energy.2022.124751 · Cited by 22
Distributed Online Constrained Optimization With Feedback Delays
Wang, C., & Xu, S. (2022) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2022.3184957 · Cited by 22
Yi, X., Zhang, S., Yang, T., Chai, T., & Johansson, K. H. (2020) · IFAC-PapersOnLine · doi:10.1016/j.ifacol.2020.12.383 · Cited by 30
$\texttt{DeepSqueeze}$: Decentralization Meets Error-Compensated CompressionPreprint
Tang, H., Lian, X., Qiu, S., Yuan, L., Zhang, C., Zhang, T., & Liu, J. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1907.07346 · Cited by 74
Achieving Linear Convergence in Distributed Aggregative Optimization Over Directed Graphs
Chen, L., Wen, G., Fang, X., Zhou, J., & Cao, J. (2024) · IEEE Transactions on Systems Man and Cybernetics Systems · doi:10.1109/tsmc.2024.3382173 · Cited by 25
Li, J., Zhu, X., Wu, Z., & Huang, T. (2021) · Information Sciences · doi:10.1016/j.ins.2021.10.003 · Cited by 21
Distributed Optimization for Second-Order Discrete-Time Multiagent Systems With Set Constraints
Zou, Y., Xia, K., Huang, B., & Meng, Z. (2021) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2021.3130173 · Cited by 22
Zhang, K., Liao, X., & Lü, Q. (2022) · IEEE Transactions on Network Science and Engineering · doi:10.1109/tnse.2022.3195953 · Cited by 21
A Bi-Event-Triggered Multi-Agent System for Distributed Optimization
Huang, B., Liu, Y., Xia, Z., et al. (2022) · IEEE Transactions on Network Science and Engineering · doi:10.1109/tnse.2022.3226763 · Cited by 21
Distributed finite‐time optimization algorithms for multi‐agent systems under directed graphs
Zhu, W., Sun, C., & Wang, Q. (2023) · International Journal of Robust and Nonlinear Control · doi:10.1002/rnc.6699 · Cited by 21
Luan, M., Wen, G., Liu, H., Huang, T., Chen, G., & Yu, W. (2023) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2023.3270185 · Cited by 28
Distributed Weakly Convex Optimization Under Random Time-Delay Interference
Wei, M., Yu, W., Liu, H., & Xu, Q. (2023) · IEEE Transactions on Network Science and Engineering · doi:10.1109/tnse.2023.3294414 · Cited by 23
“Lemma 2 [3], [4]: Let Assumptions 4–5 hold and define the corresponding adjacency matrix A ( t ) ∈ R N × N with the diagonal entries A ( t ) ii > 0 for all 1 ≤ i ≤ N .”
BackgroundAB /Push-Pull method for distributed optimization in time-varying directed networks
Nedić, A., Nguyen, D. T. A., & Nguyen, D. T. (2023) · Optimization methods & software · doi:10.1080/10556788.2023.2261602 · Cited by 42
“The work in [7] further studies the push-sum technique for time-varying directed graphs with a convergence rate of O ( ln t / √ t ) for diminishing stepsizes.”
Self-citationDistributed Algorithm for Solving Convex Inequalities
Lu, K., Jing, G., & Wang, L. (2017) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2017.2771140 · Cited by 21
A geometrically convergent method for distributed optimization over time-varying graphs
Nedić, A., Olshevsky, A., & Shi, W. (2016) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2016.7798402 · Cited by 25
“references [22]–[26] work with directed graphs.”
MethodSelf-citationLiu, J., Chen, W., & Dai, H. (2017) · International Journal of Systems Science · doi:10.1080/00207721.2017.1288840 · Cited by 21
Distributed Finite-Time Optimization
Yao, L., Yuan, Y., Sundaram, S., & Yang, T. (2018) · International Conference on Control and Automation · doi:10.1109/icca.2018.8444343 · Cited by 27
Parallel alternating direction method of multipliers
Yan, J., Guo, F., Wen, C., & Li, G. (2019) · Information Sciences · doi:10.1016/j.ins.2019.08.039 · Cited by 22
Shi, C., & Yang, G. (2020) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2020.3011837 · Cited by 21
“For instance, one of the classical algorithms is a mixture of the subgradient method and the push-sum protocol, called the subgradient-push [29].”
MethodA Push-Pull Gradient Method for Distributed Optimization in NetworksPreprint
Pu, S., Shi, W., Xu, J., et al. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1803.07588 · Cited by 21
Self-citationDistributed Information-Based Source Seeking
Zhang, T., Qin, V. L., Tang, Y., & Li, N. (2023) · IEEE Transactions on Robotics · doi:10.1109/tro.2023.3309099 · Cited by 29
“Based on the previous studies on distributed consensus and optimization over time-varying communication graphs, e.g., [44], [45], and [46], we expect our algorithm to achieve good performance as long as the network remains connected for a sufficient fraction of the time.”
BackgroundChen, Z., & Ji, H. (2020) · IEEE Transactions on Systems Man and Cybernetics Systems · doi:10.1109/tsmc.2020.2966636 · Cited by 20
Hu, H., Mo, L., & Long, F. (2022) · Asian Journal of Control · doi:10.1002/asjc.2790 · Cited by 20
“Then, these algorithms were extend to the directed unbalanced graph based on the sub-gradient algorithm and push-sum mechanism; meanwhile, the convergence rate was studied in Nedić and Olshevsky [8].”
MethodMorral, G., Bianchi, P., & Fort, G. (2017) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2017.2666771 · Cited by 19
Liu, J., Chen, W., & Dai, H. (2018) · International Journal of Control · doi:10.1080/00207179.2018.1460693 · Cited by 19
Convergence of Distributed Accelerated Algorithm Over Unbalanced Directed Networks
Li, H., Lü, Q., Chen, G., Huang, T., & Dong, Z. Y. (2019) · IEEE Transactions on Systems Man and Cybernetics Systems · doi:10.1109/tsmc.2019.2946287 · Cited by 19
“In the simulation, the convergence between SGT-FROST and other existing methods, including SP [29], WB-DGD [32], linear [48], and Push-DIGing [39] (ADD-OPT [16]) are compared.”
BackgroundMethodResultInfluentialDirected-Distributed Gradient Descent
Xi, C., & Khan, U. A. (2015) · Allerton Conference on Communication, Control, and Computing · doi:10.1109/allerton.2015.7447120 · Cited by 21
A Simple Framework for Stability Analysis of State-Dependent Networks of Heterogeneous Agents
Etesami, S. R. (2019) · SIAM Journal on Control and Optimization · doi:10.1137/18m1217681 · Cited by 18
Hong, M., Lee, J. D., & Razaviyayn, M. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1802.08941 · Cited by 24
Wei, M., Yu, W., Chen, D., Kang, M., & Cheng, G. (2025) · IEEE/CAA Journal of Automatica Sinica · doi:10.1109/jas.2024.124869 · Cited by 24
Distributed Subgradient Algorithm for Multi-Agent Optimization With Dynamic Stepsize
Ren, X., Li, D., Xi, Y., & Shao, H. (2021) · IEEE/CAA Journal of Automatica Sinica · doi:10.1109/jas.2021.1003904 · Cited by 20
“We compare it with the GRP algorithm in [20] and the primal-dual algorithm in [21].”
MethodFlexPD: A Flexible Framework of First-Order Primal-Dual Algorithms for Distributed Optimization
Mansoori, F., & Wei, E. (2021) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2021.3083981 · Cited by 24
Distributed Gradient Tracking Methods with Finite Data Rates
Ma, X., Yi, P., & Chen, J. (2021) · Journal of Systems Science and Complexity · doi:10.1007/s11424-021-1231-9 · Cited by 19
Distributed online convex optimization with a bandit primal-dual mirror descent push-sum algorithm
Wang, C., Xu, S., Yuan, D., et al. (2022) · Neurocomputing · doi:10.1016/j.neucom.2022.05.024 · Cited by 19
Xu, Q., Yu, C., Yuan, X., Fu, Z., & Liu, H. (2022) · IEEE/CAA Journal of Automatica Sinica · doi:10.1109/jas.2022.106028 · Cited by 20
“We therefore specially pay attention on study the convergence of matrix as , which has been established in [4].”
BackgroundInfluentialDecentralized Event-Triggered Federated Learning with Heterogeneous Communication Thresholds
Zehtabi, S., Hosseinalipour, S., & Brinton, C. G. (2022) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc51059.2022.9993258 · Cited by 29
Connectivity-Aware Semi-Decentralized Federated Learning over Time-Varying D2D Networks
Parasnis, R., Hosseinalipour, S., Chu, Y.-W., Chiang, M., & Brinton, C. G. (2023) · ACM International Symposium on Theory, Algorithmic Foundations, and Protocol Design for Mobile Networks and Mobile Computing (MobiHoc) · doi:10.1145/3565287.3610278 · Cited by 28
“Unlike standard works on distributed learning [1, 23–25], we do not assume the D2D network to be strongly connected or even uniformly strongly connected [23, 24] over time.”
BackgroundQiu, Z., Liu, S., & Xie, L. (2018) · International Journal of Robust and Nonlinear Control · doi:10.1002/rnc.4040 · Cited by 18
Pang, Y., & Hu, G. (2017) · Asian Control Conference (ASCC) · doi:10.1109/ascc.2017.8287157 · Cited by 16
Linearized ADMM Converges to Second-Order Stationary Points for Non-Convex Problems
Lu, S., Lee, J. D., Razaviyayn, M., & Hong, M. (2021) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2021.3100976 · Cited by 26
Doostmohammadian, M., Aghasi, A., Pirani, M., Nekouei, E., Khan, U. A., & Charalambous, T. (2022) · European Control Conference (ECC) · doi:10.23919/ecc55457.2022.9838141 · Cited by 20
“Remark 1: Note the difference of (constrained) problem (2) with general (unconstrained) distributed optimization (as in [6]–[8]).”
BackgroundInfluentialDistributed Active State Estimation With User-Specified Accuracy
Freundlich, C., Lee, S., & Zavlanos, M. M. (2017) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2017.2719867 · Cited by 21
Decentralized Consensus Optimization and Resource Allocation
Nedić, A., Olshevsky, A., & Shi, W. (2018) · Lecture notes in mathematics · doi:10.1007/978-3-319-97478-1_10 · Cited by 19
Self-citationChen, Y., Hashemi, A., & Vikalo, H. (2021) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2021.3133372 · Cited by 23
Liu, H., Yu, W., Zheng, W. X., Nedić, A., & Zhu, Y. (2023) · Automatica · doi:10.1016/j.automatica.2023.111346 · Cited by 24
Self-citationA Gradient Tracking Protocol for Optimization Over Nabla Fractional Multi-Agent Systems
Zhou, S., Wei, Y., Liang, S., & Cao, J. (2024) · IEEE Transactions on Signal and Information Processing over Networks · doi:10.1109/tsipn.2024.3402354 · Cited by 24
Yan, J., Shi, X., Guo, L., Wan, Y., & Wen, G. (2024) · IEEE Transactions on Signal and Information Processing over Networks · doi:10.1109/tsipn.2024.3407660 · Cited by 21
“In the development of the aforementioned distributed optimization algorithms [27], [28], [29], [30], [31], [32], [38], [39], [40], [41], column-stochastic matrices are employed for information mixing.”
BackgroundMethodPrivacy-Preserving Distributed Optimization for Economic Dispatch Over Balanced Directed Networks
An, W., Ding, D., Dong, H., et al. (2024) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2024.3438129 · Cited by 18
A Coordinate Descent Primal-Dual Algorithm and Application to Distributed Asynchronous Optimization
Bianchi, P., Hachem, W., & Iutzeler, F. (2015) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2015.2512043 · Cited by 180
Distributed nonconvex optimization for sparse representation
Sun, Y., & Scutari, G. (2017) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp.2017.7952916 · Cited by 18
“Since there are no convergent distributed schemes in the literature for the problem under consideration, we compare our algorithms with the subgradient-push algorithm [37], developed for convex functions with bounded subgradients.”
BackgroundMethodSaddle-point dynamics for distributed convex optimization on general directed graphs
Touri, B., & Gharesifard, B. (2016) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2016.7798375 · Cited by 19
A networked parallel algorithm for solving linear algebraic equations
You, K., Song, S., & Tempo, R. (2016) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc.2016.7798514 · Cited by 18
Gu, C., Li, J., & Wu, Z. (2019) · Journal of the Franklin Institute · doi:10.1016/j.jfranklin.2019.06.026 · Cited by 19
Distributed Optimization for Multi-Agent Systems With Time Delay
Yang, Z., Pan, X., Zhang, Q., et al. (2020) · IEEE Access · doi:10.1109/access.2020.3007731 · Cited by 18
Convergence analysis of a distributed gradient algorithm for economic dispatch in smart grids
Zhang, H., Liang, S., Jing, L., & Han, Y. (2021) · International Journal of Electrical Power & Energy Systems · doi:10.1016/j.ijepes.2021.107373 · Cited by 19
Local Prediction for Enhanced Convergence of Distributed Optimization Algorithms
Mai, V. S., & Abed, E. H. (2017) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2017.2776084 · Cited by 19
A distributed algorithm for solving mixed equilibrium problems
Lu, K., Jing, G., & Wang, L. (2019) · Automatica · doi:10.1016/j.automatica.2019.03.015 · Cited by 18
Random Node-Asynchronous Updates on Graphs
Teke, O., & Vaidyanathan, P. P. (2019) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2019.2910485 · Cited by 20
Consensus-based decentralized real-time identification of large-scale systems
Stanković, M. S., Stanković, S. S., & Stipanović, D. M. (2015) · Automatica · doi:10.1016/j.automatica.2015.07.018 · Cited by 18
Su, L., & Vaidya, N. H. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1511.01821 · Cited by 27
On the geometric convergence rate of distributed economic dispatch/demand response in power networksPreprint
Doan, T. T., & Olshevsky, A. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1609.06660 · Cited by 18
Self-citationJiang, L., Ming, X., & Zhang, X. (2025) · IEEE Transactions on Computational Social Systems · doi:10.1109/tcss.2025.3559978 · Cited by 26
Wang, Y., & Nedić, A. (2023) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2023.3348158 · Cited by 28
Self-citationPrivacy-Preserving Push-Pull Method for Decentralized Optimization via State Decomposition
Cheng, H., Liao, X., Li, H., Lü, Q., & Zhao, Y. (2024) · IEEE Transactions on Signal and Information Processing over Networks · doi:10.1109/tsipn.2024.3402430 · Cited by 25
“We compare PPSD with Push-Pull [20], AB [15], Push-DIGing [10], ADD-OPT [11], and Subgradient-Push [24] to verify the impact of security mechanisms on convergence rate.”
BackgroundMethodYe, M., & Hu, G. (2017) · International Conference on Control and Automation · doi:10.1109/icca.2017.8003162 · Cited by 17
Doan, T. T., Beck, C. L., & Srikant, R. (2018) · ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems (SIGMETRICS) · doi:10.1145/3219617.3219654 · Cited by 18
Distributed optimization with closed convex set for multi-agent networks over directed graphs
Weng, T., Wang, L., She, Z., & Liang, Q. (2018) · Journal of the Franklin Institute · doi:10.1016/j.jfranklin.2017.12.010 · Cited by 16
Stochastic gradient-push for economic dispatch on time-varying directed networks with delays
Yuan, Y., Li, H., Hu, J., et al. (2019) · International Journal of Electrical Power & Energy Systems · doi:10.1016/j.ijepes.2019.05.051 · Cited by 17
Li, J., Gu, C., & Wu, Z. (2019) · Neurocomputing · doi:10.1016/j.neucom.2019.03.094 · Cited by 17
Random Sleep Scheme-Based Distributed Optimization Algorithm Over Unbalanced Time-Varying Networks
Li, H., Wang, Z., Xia, D., & Han, Q. (2019) · IEEE Transactions on Systems Man and Cybernetics Systems · doi:10.1109/tsmc.2019.2945864 · Cited by 17
“For time-varying unbalanced directed networks, [19], [20] designed algorithms by incorporating the so-called push-sum protocol and gradient descent method.”
BackgroundMethodAn exponentially convergent distributed algorithm for resource allocation problem
Shi, X., Zheng, R., Lin, Z., et al. (2020) · Asian Journal of Control · doi:10.1002/asjc.2341 · Cited by 17
“Another important branch is the so-called subgradient-based methods, which were firstly proposed in [18,19].”
Scaling-Up Distributed Processing of Data Streams for Machine Learning
Nokleby, M., Raja, H., & Bajwa, W. U. (2020) · Proceedings of the IEEE · doi:10.1109/jproc.2020.3021381 · Cited by 27
“Several extensions to DGD have been proposed in the literature, including extensions to time-varying and directed graphs [90]–[92] and variations with stronger convergence guarantees [93]–[95].”
BackgroundA non-cooperative game-based distributed optimization method for chiller plant control
Li, S., Pan, Y., Wang, Q., et al. (2021) · Building Simulation · doi:10.1007/s12273-021-0869-5 · Cited by 17
A fast proximal gradient algorithm for decentralized composite optimization over directed networks
Zeng, J., He, T., & Wang, M. (2017) · Systems & Control Letters · doi:10.1016/j.sysconle.2017.07.005 · Cited by 17
Communication Efficient Framework for Decentralized Machine Learning
Elgabli, A., Park, J., Bedi, A. S., Bennis, M., & Aggarwal, V. (2020) · Conference on Information Sciences and Systems · doi:10.1109/ciss48834.2020.1570627384 · Cited by 20
Distributed Nonconvex Multiagent Optimization Over Time-Varying NetworksPreprint
Sun, Y., Scutari, G., & Palomar, D. P. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1607.00249 · Cited by 17
Asynchronous Subgradient-Push.Preprint
Assran, M., & Rabbat, M. (2018) · arXiv (Cornell University) · Cited by 19
Fully Asynchronous Distributed Optimization with Linear Convergence in Directed NetworksPreprint
Zhang, J., & You, K. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1901.08215 · Cited by 43
Resilient Distributed Optimization for Multiagent Cyberphysical Systems
Yemini, M., Nedić, A., Goldsmith, A. J., & Gil, S. (2025) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2025.3532791 · Cited by 34
“Convergence to an optimal point x L can be achieved for constrained multiagent problems in [5], [7], [14], [25], [26], [27], [28], [29], and [30], and with limited gradient information [31], [32].”
Self-citationMomentum-based accelerated algorithm for distributed optimization under sector-bound nonlinearity
Doostmohammadian, M., & Rabiee, H. R. (2025) · Journal of the Franklin Institute · doi:10.1016/j.jfranklin.2025.107857 · Cited by 22
Decentralized Weapon–Target Assignment Under Asynchronous Communications
Hendrickson, K., Ganesh, P., Volle, K., Buzaud, P., Brink, K., & Hale, M. (2022) · Journal of Guidance Control and Dynamics · doi:10.2514/1.g006532 · Cited by 16
Xu, H., Lu, K., Wang, T., et al. (2022) · IEEE Transactions on Circuits & Systems II Express Briefs · doi:10.1109/tcsii.2022.3213316 · Cited by 16
“Lemma 1 [20]: Under Assumption 1, for any i ∈ V and j, k ∈ V i, there exists certain H > 0 and 0 < λ < 1 satisfying ∣∣∣∣[ i(t, s)]jk − 1 ni ∣∣∣∣ ≤ Hλt−s (5)”
BackgroundFast Coordination of Distributed Energy Resources Over Time-Varying Communication Networks
Zholbaryssov, M., Hadjicostis, C. N., & Domínguez-García, A. D. (2022) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2022.3213626 · Cited by 23
On Faster Convergence of Scaled Sign Gradient Descent
Li, X., Lin, K., Li, L., Hong, Y., & Chen, J. (2023) · IEEE Transactions on Industrial Informatics · doi:10.1109/tii.2023.3280938 · Cited by 27
“Second, for case 2, in view of (31), invoking Assumption 2 with x = x k leads to 2 μV k ≤ (cid”
BackgroundTime-varying convex optimization for double-integrator dynamics over a directed network
Gong, P., Chen, F., & Lan, W. (2016) · Chinese Control Conference (CCC) · doi:10.1109/chicc.2016.7554519 · Cited by 15
Accelerated distributed Nesterov Gradient Descent for convex and smooth functions
Qu, G., & Li, N. (2017) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2017.8263979 · Cited by 19
Tutorial on Dynamic Average Consensus: The Problem, Its Applications, and the Algorithms
Kia, S. S., Scoy, B. V., Cortés, J., Freeman, R. A., Lynch, K., & Martínez, S. (2019) · IEEE Control Systems · doi:10.1109/mcs.2019.2900783 · Cited by 449
Efficient Distributed Optimization of Wind Farms Using Proximal Primal-Dual Algorithms
Annoni, J. R., Dall’Anese, E., Hong, M., & Bay, C. J. (2019) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.23919/acc.2019.8814655 · Cited by 17
Push-Sum With Transmission Failures
Gerencsér, B. S., & Hendrickx, J. M. (2018) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2018.2836861 · Cited by 23
Exact Diffusion for Distributed Optimization and Learning --- Part I: Algorithm DevelopmentPreprint
Yuan, K., Ying, B., Zhao, X., et al. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1702.05122 · Cited by 16
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.