Distributed Optimization Over Time-Varying Directed Graphs
The DOI matches its Crossref record; 36 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: 1
- tsianos, 2013, The role of the Network in Distributed Optimization Algorithms Convergence Rates Scalability Communication/Computation Tradeoffs and Communication Delays
Cited by
Items 801–900 of 1,226
Feng, Y., Zhang, W., Xiong, J., & Li, H. (2020) · IEEE Access · doi:10.1109/access.2020.2978087 · Cited by 3
Distributed Optimization for Client-Server Architecture with Negative Gradient WeightsPreprint
Gade, S., & Vaidya, N. H. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1608.03866 · Cited by 4
“Several solutions to distributed optimization of convex functions are proposed for myriad scenarios involving directed graphs [7], link failures and losses [8], asynchronous communication models [9, 10, 11], stochastic functions [4, 12, 13], fault tolerance [14, 15] and ∗This research is supported in part by National…”
BackgroundLinear convergence in optimization over directed graphs with row-stochastic matricesPreprint
Xi, C., Mai, V. S., Xin, R., et al. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1611.06160 · Cited by 3
Randomized Gradient-Free Distributed Online Optimization via a Dynamic Regret AnalysisPreprint
Pang, Y., & Hu, G. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1903.07106 · Cited by 3
Distributed algorithms for solving convex inequalitiesPreprint
Lu, K., Jing, G., & Wang, L. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1609.03161 · Cited by 3
Distributed Proximal Algorithms for Multi-Agent Optimization with Coupled Inequality ConstraintsPreprint
Li, X., Feng, G., & Xie, L. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1907.03245 · Cited by 3
“According to Lemma 1 in [23] without perturbations or errors, it can be concluded that zi,k+1 → ωi,k+1 ∑N j=1 zj,k/N exponentially.”
InfluentialZholbaryssov, M., Hadjicostis, C. N., & Domínguez-García, A. D. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1907.07600 · Cited by 3
Distributed Dual Gradient Tracking for Resource Allocation in Unbalanced NetworksPreprint
Zhang, J., You, K., & Cai, K. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1909.09937 · Cited by 3
DC-DistADMM: ADMM Algorithm for Contsrained Distributed Optimization over Directed GraphsPreprint
Khatana, V., & Salapaka, M. V. (2020) · arXiv (Cornell University) · Cited by 5
Moshpit SGD: Communication-Efficient Decentralized Training on Heterogeneous Unreliable DevicesPreprint
Ryabinin, M., Gorbunov, E., Plokhotnyuk, V., & Pekhimenko, G. G. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2103.03239 · Cited by 50
Decentralized Optimization On Time-Varying Directed Graphs Under Communication ConstraintsPreprint
Chen, Y., Hashemi, A., & Vikalo, H. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2005.13189 · Cited by 3
Finite-Time Error Bounds for Distributed Linear Stochastic ApproximationPreprint
Lin, Y., Gupta, V., & Liu, J. Y. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2111.12665 · Cited by 3
“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.”
BackgroundMethodInfluentialZhu, Y., Zhou, Z., & Miao, G. (2024) · Journal of the Franklin Institute · doi:10.1016/j.jfranklin.2024.107081 · Cited by 2
A Modified Distributed Gradient Dynamics for Multiagent Optimization on Directed Networks
Jahvani, M., & Guay, M. (2025) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2025.3526343 · Cited by 2
A Perron–Frobenius Theorem for Strongly Aperiodic Stochastic Chains
Parasnis, R., Franceschetti, M., & Touri, B. (2025) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2025.3527332 · Cited by 2
Distributed Discrete-Time Dynamic Outer Approximation of the Intersection of Ellipsoids
Sebastián, E., Aldana‐López, R., Aragüés, R., et al. (2025) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2025.3540423 · Cited by 2
Asymmetrically Decentralized Federated Learning
Li, Q., Zhang, M., Yin, N., Yin, Q., Shen, L., & Cao, X. (2025) · IEEE Transactions on Computers · doi:10.1109/tc.2025.3569185 · Cited by 12
Towards efficient compression and communication for prototype-based decentralized learning
Fernández-Piñeiro, P., Fernández‐Veiga, M., Redondo, R. P. D., Vilas, A. F., & Soto, M. G. (2025) · Applied Soft Computing · doi:10.1016/j.asoc.2025.113270 · Cited by 3
Distributed Dynamic No-Regret Learning in Two-Network Zero-Sum Games
Liao, L., Yuan, D., Ho, D. W. C., et al. (2025) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2025.3586980 · Cited by 2
Liang, L., Huang, X., Xin, R., & Yuan, K. (2025) · SIAM Journal on Optimization · doi:10.1137/24m1657341 · Cited by 9
Li, C., Wang, Q., & Psillakis, H. E. (2025) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2025.3608353 · Cited by 3
Lightweight Decentralized Federated Learning with Arbitrary Client Participation
Gong, X., Gong, X., Sun, Y., & Mao, S. (2025) · ACM International Symposium on Theory, Algorithmic Foundations, and Protocol Design for Mobile Networks and Mobile Computing (MobiHoc) · doi:10.1145/3704413.3764433 · Cited by 3
SD-PPDDA: A Privacy Efficient Decentralized Dual Averaging Algorithm Over Networks
Lü, Q., He, C., Zhang, K., Li, H., & Huang, T. (2025) · IEEE Transactions on Machine Learning in Communications and Networking · doi:10.1109/tmlcn.2025.3625519 · Cited by 2
Distributed Spatial-Temporal Trajectory Optimization for Unmanned-Aerial-Vehicle Swarm
Zheng, X., Lin, D., Tang, P., & He, S. (2026) · Journal of Guidance Control and Dynamics · doi:10.2514/1.g008979 · Cited by 4
Li, C., & Wang, Q. (2026) · Journal of the Franklin Institute · doi:10.1016/j.jfranklin.2026.108403 · Cited by 2
Doan, T. T., Beck, C. L., & Srikant, R. (2018) · ACM SIGMETRICS Performance Evaluation Review · doi:10.1145/3292040.3219654 · Cited by 2
Distributed Trajectory optimization Method for Multi-UAV Formation Rendezvous over Directed Networks
Han, D., Ma, A., Zhang, Y.-P., et al. (2019) · Chinese Control Conference (CCC) · doi:10.23919/chicc.2019.8866636 · Cited by 2
Asynchronous Algorithm for Distributed Multi-agent Convex Optimization
Zhao, D., Liu, D., & Zhang, X. (2020) · Chinese Control Conference (CCC) · doi:10.23919/ccc50068.2020.9189317 · Cited by 2
A Distributed Convex Optimization Algorithm with Continuous-Time Communication
Jahvani, M., & Guay, M. (2022) · International Symposium on Advanced Control of Industrial Processes · doi:10.1109/adconip55568.2022.9894148 · Cited by 2
Distributed projection gradient algorithm with constraints based on general directed graphs*
Yang, Z., Yang, X., & Gao, Z. (2023) · International Conference on Cyber-Energy Systems and Intelligent Energy (ICCSIE) · doi:10.1109/iccsie55183.2023.10175237 · Cited by 2
Distributed Denial-of-Service Resilient Control for Urban Air Mobility Applications
Clarke, S. G., Hwang, S., Thapliyal, O., & Hwang, I. (2023) · Journal of Aerospace Information Systems · doi:10.2514/1.i011222 · Cited by 4
Online distributed optimization with stochastic gradients: high probability bound of regrets
Yang, Y. C., Lu, K., & Wang, L. (2024) · Control Theory and Technology · doi:10.1007/s11768-023-00186-3 · Cited by 2
Distributed Online Learning Algorithms for Aggregative Games Over Time-Varying Unbalanced Digraphs
Zuo, X., & Deng, Z. (2023) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc49753.2023.10383716 · Cited by 2
Distributed Frank-Wolfe Solver for Stochastic Optimization With Coupled Inequality Constraints
Hou, J., Zeng, X., Wang, G., et al. (2024) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2024.3423376 · Cited by 2
Sublinear Dynamic Regrets for Aggregative Games With Feedback Delays and Communication Delays
Liu, P., Wang, L., & Chen, Y. (2024) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2024.3432250 · Cited by 2
Distributed Optimization with Gradient Tracking Over Heterogeneous Delay-Prone Directed Networks
Makridis, E., Oliva, G., Narahari, K. R., Doostmohammadian, M., Khan, U. A., & Charalambous, T. (2024) · European Control Conference (ECC) · doi:10.23919/ecc64448.2024.10590963 · Cited by 6
Distributed Deep Learning for Real-World Implicit Mapping in Multi-Robot Systems
Jeong, E., Gwak, J., Kim, T., et al. (2024) · International Conference on Control, Automation and Systems (ICCAS) · doi:10.23919/iccas63016.2024.10773094 · Cited by 2
Shahriari-Mehr, F., & Panahi, A. (2024) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2024.3520513 · Cited by 4
“The methods [28], [29] based on the push-sum protocol still require a decaying step size for convergence.”
Liu, B., Du, W., & Li, Z. (2025) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2025.3539580 · Cited by 2
Gradient-free distributed online optimization in networks
Liu, Y., Zhao, W., Zhang, N., Lv, D., & Zhang, S. (2025) · Control Theory and Technology · doi:10.1007/s11768-025-00242-0 · Cited by 3
Performing accelerated convergence in decentralized economic dispatch over dynamic directed networks
Lv, Y., Xiong, H., Zhang, F., et al. (2025) · Journal of the Franklin Institute · doi:10.1016/j.jfranklin.2025.107611 · Cited by 2
Distributed Event-Triggered Bandit Convex Optimization With Time-Varying Constraints
Zhang, K., Yi, X., Wen, G., Cao, M., Johansson, K. H., Chai, T., & Yang, T. (2025) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2025.3558791 · Cited by 2
Adaptive Weighting Push-SUM for Decentralized Optimization With Statistical Diversity
Zhou, Y., Cheng, Y., Xu, L., & Chen, E. (2025) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2025.3566329 · Cited by 5
“These values are nearly the same as the multiplier 8 N NB and the base (1 − 1 N NB ) 1 NB in the original Push-SUM protocol (see [6, Lemma 1]).”
InfluentialOn the convergence result of the gradient-push algorithm on directed graphs with constant stepsize
Choi, W., Kim, D., & Yun, S.-B. (2025) · Journal of Global Optimization · doi:10.1007/s10898-025-01506-4 · Cited by 2
Farkhad, M. K., & Foroud, A. A. (2021) · Iranian Journal of Science and Technology Transactions of Electrical Engineering · doi:10.1007/s40998-021-00461-6 · Cited by 3
Zhu, J., Zhang, M., Xu, C., et al. (2016) · International Journal of Distributed Sensor Networks · doi:10.1177/155014779685385 · Cited by 2
Generalised gossip-based subgradient method for distributed optimisation
Jiang, Z., Mukherjee, K., & Sarkar, S. (2017) · International Journal of Control · doi:10.1080/00207179.2017.1387288 · Cited by 2
“However, if the step size α l is diminishing, we know from Nedic and Olshevsky (2015) (cid”
BackgroundShi, X., Song, S., Wang, Y., et al. (2017) · doi:10.1109/crc.2017.25 · Cited by 2
Baron-Prada, E., Uribe, C. A., & Mojica‐Nava, E. (2018) · IFAC-PapersOnLine · doi:10.1016/j.ifacol.2018.12.065 · Cited by 2
Distributed Optimization in Multi-agent Networks Using One-bit of Relative State Information
Zhang, J., & You, K. (2018) · Systems & control · doi:10.1007/978-3-030-04630-9_13 · Cited by 2
Shi, Z., & Zhou, C. (2019) · Journal of Optimization Theory and Applications · doi:10.1007/s10957-019-01588-7 · Cited by 2
Duality and Stability in Complex Multiagent State-Dependent Network Dynamics
Etesami, S. R. (2020) · SIAM Journal on Control and Optimization · doi:10.1137/19m1296628 · Cited by 2
Pang, Y., & Hu, G. (2019) · International Conference on Control and Automation · doi:10.1109/icca.2019.8900009 · Cited by 2
Improved Convergence Rates of P-EXTRA for Non-smooth Distributed optimization
Wu, X., & Lu, J. (2019) · International Conference on Control and Automation · doi:10.1109/icca.2019.8899909 · Cited by 3
Distributed Gradient Algorithm for Economic Dispatch of Multi-area Power Systems
Shao, S., Gao, F., Wu, J., Liu, R., Yang, Y., & Duan, F. (2019) · IEEE Sustainable Power and Energy Conference (iSPEC) · doi:10.1109/ispec48194.2019.8975026 · Cited by 3
Computable Convergence Rate Bound for Ratio Consensus Algorithms
Gerencsér, B. S. (2022) · IEEE Control Systems Letters · doi:10.1109/lcsys.2022.3184655 · Cited by 3
“Ratio consensus algorithms became the building blocks of further methods requiring distributed computation, such as the analysis of sensors networks [5], the spectral analysis of a network [6] or distributed optimization [7], just to highlight a few.”
MethodPerformance Optimization of Distributed Primal-Dual Algorithms over Wireless Networks
Yang, Z., Chen, M., Wong, K., Saad, W., Poor, H. V., & Cui, S. R. (2021) · International Conference on Communications · doi:10.1109/icc42927.2021.9500853 · Cited by 2
Consensus of the Leaderless Second-order Heterogeneous Linear Multi-agent System
Chen, Y., Xu, G., & Zhan, J. (2021) · International Conference on Intelligent Robotics and Control Engineering (IRCE) · doi:10.1109/irce53649.2021.9570992 · Cited by 2
Distributed Gaussian Process Mapping for Robot Teams with Time-varying Communication
Di, J., Zobeidi, E., Koppel, A., & Atanasov, N. (2022) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.23919/acc53348.2022.9867415 · Cited by 5
“communication and is utilized for many results in multi-agent coordination and distributed optimization [24], [25].”
Distributed nonlinear estimation over time-varying directed networks
Wang, Q., & Meng, M. (2022) · Information Sciences · doi:10.1016/j.ins.2022.11.079 · Cited by 2
Distributed Nash Equilibrium Seeking for Decomposable Pseudo-Gradient
Gadjov, D., & Pavel, L. (2022) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc51059.2022.9992975 · Cited by 2
Odeyomi, O. T. (2023) · IEEE Access · doi:10.1109/access.2023.3244070 · Cited by 3
Zhou, S., Peng, H., Hong, X., et al. (2023) · International Symposium on Autonomous Systems (ISAS) · doi:10.1109/isas59543.2023.10164541 · Cited by 2
Decentralized Coordination of DERs for Dynamic Economic Emission Dispatch
Dai, J., & Wang, Z. (2023) · Applied Sciences · doi:10.3390/app132212431 · Cited by 2
Geng, B., Chai, J., Yang, F., et al. (2023) · Chinese Control and Decision Conference (CCDC) · doi:10.1109/ccdc58219.2023.10326974 · Cited by 2
Taha, F. A., Rokade, K., & Parise, F. (2023) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc49753.2023.10383490 · Cited by 2
“Specifically, a large literature focused on cooperative problems such as consensus/gossip algorithms [25], [26] as well as distributed optimization [27] over time-varying networks, mainly based on an assumption of uniform connectivity over contiguous ar X iv :2 30 9.”
BackgroundDistributed Algorithms for Edge-Agreements: More than Consensus
Rai, A., & Mou, S. (2023) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc49753.2023.10383451 · Cited by 2
Distributed statistical estimation in quantile regression over a network
Wang, Y., Lu, W., & Lian, H. (2024) · Signal Processing · doi:10.1016/j.sigpro.2024.109512 · Cited by 2
The minimizer of the sum of two strongly convex functions
Kuwaranancharoen, K., & Sundaram, S. (2024) · Optimization · doi:10.1080/02331934.2024.2402923 · Cited by 6
“Following the framework described in [8], the problem is commonly explored within two main architectural paradigms: the distributed setting, marked by a client-server architecture [9, 10, 11], and the decentralized setting, characterized by a peer-to-peer architecture [12, 13, 14].”
InfluentialLiu, L., & Yang, H. (2016) · International Journal of Security and Its Applications · doi:10.14257/ijsia.2016.10.4.34 · Cited by 2
Distributed Online Learning over Time-varying Graphs via Proximal Gradient Descent
Dixit, R., Bedi, A. S., Rajawat, K., & Koppel, A. (2019) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc40024.2019.9029852 · Cited by 2
“However, {Gt} is still required to be uniformly strongly connected or B-connected [26]; see Sec.”
BackgroundMethodRomao, L. B. R. R., Margellos, K., Notarstefano, G., & Papachristodoulou, A. (2019) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc40024.2019.9029252 · Cited by 2
Distributed empirical risk minimization over directed graphs
Xin, R., Sahu, A. K., Kar, S., & Khan, U. A. (2019) · Asilomar Conference on Signals, Systems and Computers (ACSSC) · doi:10.1109/ieeeconf44664.2019.9049065 · Cited by 3
Distributed multi‐agent optimisation via coordination with second‐order nearest neighbours
Ren, X., Li, D., Xi, Y., et al. (2020) · IET Control Theory and Applications · doi:10.1049/iet-cta.2019.0708 · Cited by 2
Robust Asynchronous and Network-Independent Cooperative Learning
Mojica‐Nava, E., Yanguas-Rojas, D., & Uribe, C. A. (2021) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.23919/acc50511.2021.9483387 · Cited by 2
Li, W., Assaad, M., & Zheng, S. (2021) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2021.3077516 · Cited by 3
Protocol for Constrained Multi-Agent Optimization with Arbitrary Local Solvers
Zhang, Y., Su, Y., & Liu, F. (2021) · International Conference on Information Science and Technology · doi:10.1109/icist52614.2021.9440651 · Cited by 2
Robust Multi-Agent Optimization: Coping with Packet-Dropping Link Failures.Preprint
Su, L., & Vaidya, N. H. (2016) · arXiv (Cornell University) · Cited by 3
A Bregman Splitting Algorithm for Distributed Optimization over NetworksPreprint
Xu, J., Zhu, S., Soh, Y. C., & Xie, L. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1608.08031 · Cited by 2
A Communication-Efficient Multi-Agent Actor-Critic Algorithm for Distributed Reinforcement LearningPreprint
Lin, Y., Zhang, K., Yang, Z., et al. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1907.03053 · Cited by 2
“(16) From Lemma 1 (b) in [29], we know that limt→∞ z i t = limt→∞〈ω̃t〉.”
Distributed Resource Allocation over Time-varying Balanced Digraphs with Discrete-time CommunicationPreprint
Su, L., Li, M., Gupta, V., et al. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1907.13003 · Cited by 2
Optimally Compressed Nonparametric Online LearningPreprint
Koppel, A., Bedi, A. S., Rajawat, K., et al. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1909.11555 · Cited by 2
“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].”
BackgroundFlexPD: A Flexible Framework Of First-Order Primal-Dual Algorithms for Distributed OptimizationPreprint
Mansoori, F., & Wei, E. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1912.07526 · Cited by 2
Gradient-Consensus: Linearly Convergent Distributed Optimization Algorithm over Directed GraphsPreprint
Khatana, V., Saraswat, G., Patel, S., & Salapaka, M. V. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1909.10070 · Cited by 7
Asynchronous Networked Aggregative GamesPreprint
Zhu, R., Zhang, J., You, K., & Başar, T. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2101.08973 · Cited by 1
“Then, the proof is similar to that of Nedić & Olshevsky (2014, Lemma 1).”
MethodResultInfluentialProvably Accelerated Decentralized Gradient Method Over Unbalanced Directed GraphsPreprint
Song, Z., Shi, L., Pu, S., & Yan, M. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2107.12065 · Cited by 1
On Faster Convergence of Scaled Sign Gradient DescentPreprint
Li, X., Lin, K.-Y., Li, L., et al. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2109.01806 · Cited by 2
“Second, for case 2, in view of (31), invoking Assumption 2 with x = x k leads to 2 μV k ≤ (cid”
BackgroundAsynchronous Distributed Optimization Via Randomized Dual Proximal Gradient
Notarnicola, I., & Notarstefano, G. (2016) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2016.2607023 · Cited by 87
Zhang, J., Liu, L., & Ji, H. (2022) · International Journal of Robust and Nonlinear Control · doi:10.1002/rnc.6059 · Cited by 1
“Then, Problem 1 can be solved by a distributed dynamic controller composed of (5) and (7).”
BackgroundInfluentialXiong, Y., You, K., & Wu, L. (2020) · International Conference on Control and Automation · doi:10.1109/icca51439.2020.9264323 · Cited by 1
“Lemma 2 ( [9]): Let {hk} be a sequence of nonnegative scalars such that for all k ≥ 0 hk+1 ≤ (1 + bk)hk − uk + ck where bk ≥ 0, uk ≥ 0 and ck ≥ 0 for all k ≥ 0 with ∑∞ k=1 bk <∞ and ∑∞ k=1 ck <∞.”
BackgroundMethodInfluentialDistributed Continuous Time Optimization Algorithms over Unbalanced Graphs
Cheng, S., & Fan, Y. C. (2021) · Chinese Control and Decision Conference (CCDC) · doi:10.1109/ccdc52312.2021.9602111 · Cited by 1
“Another method of eliminating the unbalance of the direct topologies is the push-sum based algorithm, which sent the weighted decision variable based on the out-degree of the counterpart node [16-19].”
Xu, Q., Yu, C., Xiang, Y., Wei, M., & liu, H. (2023) · Frontiers of Information Technology & Electronic Engineering · doi:10.1631/fitee.2200596 · Cited by 1
Distributed Optimization with Noisy Information Sharing
Wang, Y. (2023) · Chinese Control Conference (CCC) · doi:10.23919/ccc58697.2023.10240327 · Cited by 1
Decentralized Conjugate Gradient Tracking for Sum-of-Nonconvex Optimization
Zhang, Z., & Ni, Y.-H. (2024) · Chinese Control Conference (CCC) · doi:10.23919/ccc63176.2024.10661557 · Cited by 1
A Distributed Accelerated Algorithm Based on a Unified Momentum Method
Chen, Y., & Yang, Q. (2024) · Journal of Optimization Theory and Applications · doi:10.1007/s10957-024-02552-w · Cited by 1
Distributed Constrained Optimization Algorithms for Drones
Liu, H. (2025) · Drones · doi:10.3390/drones9010036 · Cited by 1
Distributed algorithms with linear convergence for aggregative games over time-varying networks
Zhu, R., Wang, F., Liu, Z., et al. (2025) · Expert Systems with Applications · doi:10.1016/j.eswa.2025.126768 · Cited by 1
Li, C., & Wang, Q. (2025) · Neurocomputing · doi:10.1016/j.neucom.2025.130000 · Cited by 1
Gradient Tracking for Sum‐of‐Nonconvex Decentralized Optimization
Zhang, Z., & Ni, Y. (2025) · International Journal of Robust and Nonlinear Control · doi:10.1002/rnc.7978 · Cited by 1
Wu, W., Zhu, W., & Wang, Q. (2025) · Nonlinear Dynamics · doi:10.1007/s11071-025-11175-3 · Cited by 1
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.