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.
Distributed Optimization Over Time-Varying Directed Graphs
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
Stability 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
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 901–1,000 of 1,226
Nash Equilibrium Seeking of Monotone N-Coalition Games
Sun, C., Chen, B., Wang, J., et al. (2025) · Journal of Systems Science and Complexity · doi:10.1007/s11424-025-4486-8 · Cited by 1
Distributed Stochastic Frank–Wolfe for Constrained Composite Minimization
Hou, J., Zeng, X., Cui, S., et al. (2025) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2025.3581321 · Cited by 1
Friedkin-Johnsen Model is Distributed Gradient Descent
Akgün, O. E., Vèkássy, Á., Ballotta, L., et al. (2025) · IEEE Control Systems Letters · doi:10.1109/lcsys.2025.3581718 · Cited by 1
Online Distributed Convex Optimization for Unbalanced Varying Graphs With Delayed Feedback
Mao, S., Du, W., Tian, Y., et al. (2025) · IEEE Transactions on Circuits and Systems I Regular Papers · doi:10.1109/tcsi.2025.3577591 · Cited by 1
Accelerated Local Voting Protocol for Single Remote Controller Robot Swarm System
Arkhipov, I., Erofeeva, V., Granichin, O. N., et al. (2025) · Informatics and Automation · doi:10.15622/ia.24.4.2 · Cited by 1
Distributed Multi-scheme Optimization via A Projection Multi-agent System Approach
Xia, Z., Huang, B., Wang, H., et al. (2025) · IEEE International Conference on Real-time Computing and Robotics (RCAR) · doi:10.1109/rcar65431.2025.11139580 · Cited by 1
A Small Gain Approach to Distributed Convex Optimization via Heavy-Ball and Gradient Tracking
Ni, W., Xiao, Y., & Qiu, Y. (2025) · Chinese Control Conference (CCC) · doi:10.23919/ccc64809.2025.11178295 · Cited by 1
Zhang, K., Liao, X., & Li, H. (2025) · IEEE Transactions on Dependable and Secure Computing · doi:10.1109/tdsc.2025.3620745 · Cited by 1
Survey and prospects of distributed optimization in multi-agent systems
Jiang, X., Xianlin, Z. E. N. G., Sun, J. Q., & Chen, J. (2025) · Scientia Sinica Informationis · doi:10.1360/ssi-2025-0337 · Cited by 1
Doostmohammadian, M., Gabidullina, Z. R., & Rabiee, H. R. (2025) · Engineering Applications of Artificial Intelligence · doi:10.1016/j.engappai.2025.113018 · Cited by 7
Local consensus based multi-objective distributed optimization and its application
Guo, J., Shao, L., Lv, Q., & Liang, S. (2025) · Systems & Control Letters · doi:10.1016/j.sysconle.2025.106290 · Cited by 1
Distributed Zeroth-Order Gradient Tracking for Weakly Convex Optimization Over Unbalanced Graphs
Wang, R., Cheng, S., Fan, Y. C., & Qiu, J. (2025) · IEEE Transactions on Signal and Information Processing over Networks · doi:10.1109/tsipn.2025.3636755 · Cited by 2
Decentralized Stochastic Optimization Over Unreliable Networks via Two-Timescales Updates
Liu, H., Yau, C.-Y., & Wai, H.-T. (2025) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2025.3639067 · Cited by 1
Resource-Constrained Decentralized Federated Learning via Personalized Event-Triggering
Zehtabi, S., Hosseinalipour, S., & Brinton, C. G. (2025) · IEEE Transactions on Networking · doi:10.1109/ton.2025.3635484 · Cited by 10
Huang, L., Su, R., Ma, M., Lu, Y. P., & Duan, P. (2025) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2025.3639277 · Cited by 1
Regularization-based distributed bilevel nonsmooth optimization over unbalanced graphs
Fu, Y., Wang, J., Cheng, S., et al. (2026) · Communications in Nonlinear Science and Numerical Simulation · doi:10.1016/j.cnsns.2026.109714 · Cited by 1
Asynchronous Push-Sum Dual Gradient Algorithm in Distributed Model Predictive Control
Wang, P., Ren, X., & Zheng, D. (2026) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2026.3652897 · Cited by 1
Accelerated SPSA-based Consensus Algorithm for Mutual Device Positioning
Chernov, A. V., Erofeeva, V., Granichin, O. N., & Sudomir, A. (2025) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc57313.2025.11312296 · Cited by 1
Yang, Y., Lu, K., & Wang, L. (2026) · Systems & Control Letters · doi:10.1016/j.sysconle.2026.106358 · Cited by 4
Chen, Z., Yu, W., & Liu, Q. (2026) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2026.3652224 · Cited by 1
Decentralized Constrained Optimization Over Time-Varying Directed Networks via Subgradient Rescaling
Lü, Q., Li, H., Wu, C., et al. (2026) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2026.3660676 · Cited by 1
Ji, L., & Mao, S. (2026) · Journal of the Franklin Institute · doi:10.1016/j.jfranklin.2026.108575 · Cited by 1
Stochastic Push–Pull for Decentralized Nonconvex Optimization
You, R., & Pu, S. (2026) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2026.3675119 · Cited by 1
Consensus for a class of singular multi-agent systems based on pseudo predictive control
Li, C., & Liu, S. (2017) · Chinese Control Conference (CCC) · doi:10.23919/chicc.2017.8028564 · Cited by 1
Singularly perturbed dynamics for distributed multi-agent optimization
Ye, M., & Hu, G. (2017) · Chinese Control Conference (CCC) · doi:10.23919/chicc.2017.8027827 · Cited by 1
Distributed Optimization with Binary Relative Information over Deterministically Time-varying Graphs
Zhang, J., & You, K. (2018) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc.2018.8619132 · Cited by 1
A Novel Distributed Algorithm for Constrained Resource Allocation
Wang, X., Sun, C., & Sun, T. (2019) · International Conference on Intelligent Human-Machine Systems and Cybernetics · doi:10.1109/ihmsc.2019.10171 · Cited by 1
Consensus-Based Quantized Algorithm for Convex Optimization with Smooth Cost Functions
Hayashi, N., Kajiyama, Y., & Takai, S. (2020) · IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences · doi:10.1587/transfun.2019map0008 · Cited by 1
An Inexact Fenchel Dual Gradient Algorithm for Distributed Optimization
Wang, H., & Lu, J. (2020) · International Conference on Control and Automation · doi:10.1109/icca51439.2020.9264365 · Cited by 1
Convergence Results of a Nested Decentralized Gradient Method for Non-strongly Convex Problems
Choi, W., Kim, D., & Yun, S.-B. (2022) · Journal of Optimization Theory and Applications · doi:10.1007/s10957-022-02069-0 · Cited by 1
Hu, R. L., & Zhang, B. (2021) · Journal of Mathematics · doi:10.1155/2021/6115451 · Cited by 1
Local Model Privacy-Preserving Study for Federated Learning
Pan, K., He, D., & Xu, C. (2021) · Lecture notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering · doi:10.1007/978-3-030-90019-9_15 · Cited by 1
Liu, Y., Wang, Z., Zhu, C., Wang, D., & Wang, W. (2021) · Chinese Control and Decision Conference (CCDC) · doi:10.1109/ccdc52312.2021.9602466 · Cited by 1
Resilient Online Distributed Optimization Algorithm against Byzantine Attacks
Li, L., Li, X., & Teng, F. (2022) · Asian Control Conference (ASCC) · doi:10.23919/ascc56756.2022.9828148 · Cited by 1
Xu, Q., Fu, Z., Zou, B., Liu, H., & Wang, L. (2022) · IEEE/CAA Journal of Automatica Sinica · doi:10.1109/jas.2022.105890 · Cited by 1
A Snapshot Gradient Tracking for Distributed Optimization over Digraphs
Che, K., & Yang, S. (2022) · Lecture notes in computer science · doi:10.1007/978-3-031-20503-3_28 · Cited by 1
Computational Convergence Rate Analysis of Distributed Optimization Algorithm
Du, J., Liu, Y., Zhi, Y., & Gao, H. B. (2023) · Lecture notes in electrical engineering · doi:10.1007/978-981-19-6613-2_511 · Cited by 2
A differentially private distributed optimization method for constrained optimization
Gu, C., Zhou, T., Li, J., & Wu, C. (2023) · Journal of Industrial and Management Optimization · doi:10.3934/jimo.2023039 · Cited by 1
An Accelerated Asynchronous Distributed Method for Convex Constrained Optimization Problems
Abolfazli, N., Jalilzadeh, A., & Hamedani, E. Y. (2023) · Conference on Information Sciences and Systems · doi:10.1109/ciss56502.2023.10089633 · Cited by 1
Farkhad, M. K., & Foroud, A. A. (2023) · IET Generation Transmission & Distribution · doi:10.1049/gtd2.12842 · Cited by 1
Accelerated Distributed Stochastic Non-Convex Optimization over Time-Varying Directed Networks
Chen, Y., Hashemi, A., & Vikalo, H. (2023) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp49357.2023.10094584 · Cited by 2
Distributed Outer Approximation of the Intersection of Ellipsoids
Aldana‐López, R., Sebastián, E., Aragüés, R., et al. (2023) · IEEE Control Systems Letters · doi:10.1109/lcsys.2023.3280259 · Cited by 1
A Totally Asynchronous Block-Based Heavy Ball Algorithm for Convex Optimization
Hustig-Schultz, D. M., Hendrickson, K., Hale, M., & Sanfelice, R. G. (2023) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.23919/acc55779.2023.10156324 · Cited by 1
Distributed Finite-Time Average Consensus Over Unbalanced Digraphs via Broadcast Mode
Wang, S., Xiao, J., Hu, X., Luo, H., Chen, T., & Zuo, Z. (2023) · IEEE Transactions on Network Science and Engineering · doi:10.1109/tnse.2023.3301029 · Cited by 2
“The well-studied gossip algorithm [10] and some distributed optimization methods [11], [12] follow the same weight assumption.”
MethodDistributed Stochastic Gradient Descent With Compressed and Skipped Communication
Phuong, T. T., Phong, L. T., & Fukushima, K. (2023) · IEEE Access · doi:10.1109/access.2023.3315331 · Cited by 1
Luo, K., Zhang, K., Zhang, S., Li, X., & Gao, M. (2023) · Frontiers in artificial intelligence and applications · doi:10.3233/faia230445 · Cited by 1
Consensus-Based Distributed Exp3 Policy Over Directed Time-Varying Networks
NAKAMURA, T., HAYASHI, N., & INUIGUCHI, M. (2023) · IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences · doi:10.1587/transfun.2023map0008 · Cited by 1
Fractional order distributed optimization algorithm based on proportional-integral protocol
Zhou, S., Zeng, Y., Hong, X., et al. (2023) · Chinese Control and Decision Conference (CCDC) · doi:10.1109/ccdc58219.2023.10326847 · Cited by 1
Wu, J., & Tian, Y. (2023) · IEEE Access · doi:10.1109/access.2023.3347649 · Cited by 1
Wei, M., Chen, D., Yu, W., & Yao, L. (2023) · International Conference on Information Science and Technology · doi:10.1109/icist59754.2023.10367176 · Cited by 1
Extremum information transfer over networks for remote estimation and distributed learning
Vasconcelos, M. M., & Mitra, U. (2024) · Frontiers in Complex Systems · doi:10.3389/fcpxs.2024.1322785 · Cited by 1
Agrawal, N., Cavalcante, R., & Stańczak, S. (2024) · International ITG Workshop on Smart Antennas · doi:10.1109/wsa61681.2024.10511748
A distributed algorithm for solving quadratic optimization problems
Jahvani, M., & Guay, M. (2024) · Computers & Chemical Engineering · doi:10.1016/j.compchemeng.2024.108778 · Cited by 1
Federated Learning on Heterogeneous Opportunistic Networks
Deng, Y., & Xin, Y. (2024) · International Seminar on Artificial Intelligence, Networking and Information Technology (AINIT) · doi:10.1109/ainit61980.2024.10581819 · Cited by 1
Distributed Least-Squares Optimization Solvers with Differential Privacy
Liu, W., Wang, L., Guo, F., Wu, Z., & Su, H. (2024) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.23919/acc60939.2024.10644636
Linear Convergence of Asynchronous Gradient Push Algorithm for Distributed Optimization
Li, H., Cheng, H., Lü, Q., Wang, Z., & Huang, T. (2024) · IEEE Transactions on Systems Man and Cybernetics Systems · doi:10.1109/tsmc.2024.3516936 · Cited by 3
Learning Trust Over Directed Graphs in the Presence of Adversaries
Akgün, O. E., Day, A. M., Nedić, A., & Gil, S. (2025) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2025.3578424 · Cited by 6
Self-citationKajiyama, Y., Hayashi, N., & Takai, S. (2017) · Transactions of the Institute of Systems Control and Information Engineers · doi:10.5687/iscie.30.253 · Cited by 1
“文献 [6–8]ではエージェントの状態 に制約がある場合,文献 [9]ではエージェント間の通信 が有向グラフで表される場合,文献 [10,11]ではエージェ ントの状態を量子化して通信を行う場合での分散劣勾配 アルゴリズムが提案されている.”
Zhu, J., Xie, P., Wu, Q., Zhang, M., Zheng, R., Guan, J., & Xu, C. (2017) · Mathematical Problems in Engineering · doi:10.1155/2017/1793291 · Cited by 1
A distributed predictive scheme for economic dispatch with heterogeneous time delays in smart grids
Chen, X., & Chen, F. (2017) · Proceedings of the Annual Conference of the IEEE Industrial Electronics Society · doi:10.1109/iecon.2017.8216883 · Cited by 1
Wang, D., Yin, J., & Wang, W. (2018) · International Conference on Information Science and Technology · doi:10.1109/icist.2018.8426143 · Cited by 1
Distributed Convergence to Saddle-Points Over General Directed Multi-Agent Networks
Yang, S., Xu, W., & Guo, Z. (2018) · International Conference on Control and Automation · doi:10.1109/icca.2018.8444344 · Cited by 1
Distributed Fenchel Dual Gradient Methods Enabling a Smoothing Technique for Nonsmooth Optimization
Wu, X., Sou, K. C., & Lu, J. (2018) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc.2018.8619031 · Cited by 1
Asynchronous Algorithms for Computing Equilibrium Prices in a Capital Asset Pricing Model
Tong, J., Hu, J.-Q., & You, J. (2019) · Asia Pacific Journal of Operational Research · doi:10.1142/s0217595919500234 · Cited by 1
Distributed Constrained Consensus of Utilities via a Self Evaluation Approach
Wang, X., Sun, C., & Sun, T. (2019) · IEEE Access · doi:10.1109/access.2019.2939018 · Cited by 1
Liang, S., Cheng, S., & Peng, K. (2019) · Chinese Control Conference (CCC) · doi:10.23919/chicc.2019.8866018 · Cited by 1
A randomized incremental primal-dual method for decentralized consensus optimization
Chen, C., Chen, Y., & Ye, X. (2019) · Analysis and Applications · doi:10.1142/s0219530519410082 · Cited by 2
“The DCO problem (1) has a wide range of applications such as distributed machine learning [6, 12, 20, 24], sensor networks [17, 35, 41], smart grids [13, 27], multiple-agent control and coordination [32, 33, 49].”
BackgroundDistributed Stochastic Algorithm for Convex optimization Problem Over Time-varying Directed Graphs
Cheng, S., Wang, Y., & Hong, Y. (2019) · International Conference on Control and Automation · doi:10.1109/icca.2019.8899958 · Cited by 1
Distributed Proximal Point Algorithm for Constrained Optimization over Unbalanced Graphs
Li, X., Feng, G., & Xie, L. (2019) · International Conference on Control and Automation · doi:10.1109/icca.2019.8899938 · Cited by 1
Row-Stochastic Matrices Based Distributed Optimization Algorithm With Uncoordinated Step-Sizes
Li, H., Wang, J., & Wang, Z. (2019) · International Conference on Information, Cybernetics, and Computational Social Systems (ICCSS) · doi:10.1109/iccss48103.2019.9115478 · Cited by 4
Distributed Optimal Economic Dispatch with Uncoordinated Fixed Step Sizes for Microgrids
Mao, S., Dong, Z., Du, W., et al. (2020) · IEEE International Symposium on Industrial Electronics (ISIE) · doi:10.1109/isie45063.2020.9152233 · Cited by 1
Li, H., Lü, Q., Wang, Z., Liao, X., & Huang, T. (2020) · Springer eBooks · doi:10.1007/978-981-15-6109-2_2 · Cited by 1
Asynchronous Broadcast-Based Distributed Optimization over Unbalanced Directed Networks
Li, H., Lü, Q., Wang, Z., Liao, X., & Huang, T. (2020) · Springer eBooks · doi:10.1007/978-981-15-6109-2_4 · Cited by 1
Random Sleep Scheme-Based Distributed Optimization over Time-Varying Directed Networks
Li, H., Lü, Q., Wang, Z., Liao, X., & Huang, T. (2020) · Springer eBooks · doi:10.1007/978-981-15-6109-2_7 · Cited by 1
Distributed Stochastic Optimization: Variance Reduction and Edge-Based Method
Li, H., Lü, Q., Wang, Z., Liao, X., & Huang, T. (2020) · Springer eBooks · doi:10.1007/978-981-15-6109-2_8 · Cited by 1
Li, H., Lü, Q., Wang, Z., Liao, X., & Huang, T. (2020) · Springer eBooks · doi:10.1007/978-981-15-6109-2_3 · Cited by 1
Event-Triggered Scheme-Based Distributed Optimization over Digital Network with Limited Data Rate
Li, H., Lü, Q., Wang, Z., Liao, X., & Huang, T. (2020) · Springer eBooks · doi:10.1007/978-981-15-6109-2_6 · Cited by 1
Primal-dual algorithm for distributed optimization with local domains on signed networks
Ren, X., Li, D., Xi, Y., Pan, L., & Shao, H. (2020) · Chinese Control Conference (CCC) · doi:10.23919/ccc50068.2020.9189564 · Cited by 1
Accelerated Row-stochastic Optimization over Directed Graphs with Uncoordinated Step Sizes
Zhou, K., Du, Z., & Li, H. (2020) · International Conference on Control and Automation · doi:10.1109/icca51439.2020.9264515 · Cited by 1
Optimising Cost vs Accuracy of Decentralised Analytics in Fog Computing Environments
Valerio, L., Passarella, A., & Conti, M. (2021) · IEEE Transactions on Network Science and Engineering · doi:10.1109/tnse.2021.3101986 · Cited by 1
Stochastic Gradient-Push for Economic Dispatch on Time-Varying Digraphs
Wang, H., Li, H., & Zhou, B. (2021) · Springer eBooks · doi:10.1007/978-981-33-4528-7_6 · Cited by 1
Bao, X., Zhou, B., & Wang, H. (2021) · International Conference on Information Science and Technology · doi:10.1109/icist52614.2021.9440630 · Cited by 1
Shi, X., Liu, H., Chen, J., et al. (2021) · Chinese Control and Decision Conference (CCDC) · doi:10.1109/ccdc52312.2021.9602039 · Cited by 1
Shen, X., Su, S., & Hou, H.-L. (2021) · Chinese Physics B · doi:10.1088/1674-1056/abfb5b · Cited by 1
Decentralized Stochastic Optimization With Random Attendance
Phuong, T. T., & Phong, L. T. (2022) · IEEE Signal Processing Letters · doi:10.1109/lsp.2022.3179331 · Cited by 1
Distributed Convex Optimization on the Nonnegative Orthant
Jahvani, M., & Guay, M. (2022) · European Control Conference (ECC) · doi:10.23919/ecc55457.2022.9838106 · Cited by 1
Variable Metric Primal-Dual Method for Convex Optimization Problems with Changing Constraints
Васильевич, К. И. (2023) · Lobachevskii Journal of Mathematics · doi:10.1134/s1995080223010237 · Cited by 1
A non-cooperative game-based distributed optimization for chilled water pumps control
Li, S., Pan, Y., & Huang, Z. (2023) · Building Simulation Conference proceedings · doi:10.26868/25222708.2023.1164 · Cited by 1
Distributed Random-Fixed Projected Algorithm for Constrained Optimization Over DigraphsPreprint
Xie, P., You, K., Song, S., et al. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1701.05986 · Cited by 1
“For time-varying graphs, a common assumption is that the graph sequence {G(t)} is uniformly strongly connected (Nedić and Olshevsky, 2015), i.”
BackgroundDistributed Algorithms for Solving a Class of Convex Feasibility ProblemsPreprint
Lu, K., Jing, G., & Wang, L. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1612.04913 · Cited by 1
Stochastic Learning in Potential Games: Communication and Payoff-Based ApproachesPreprint
Tatarenko, T. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1804.04403 · Cited by 2
Dynamic Average Diffusion with randomized Coordinate UpdatesPreprint
Ying, B., Yuan, K., & Sayed, A. H. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1810.08901 · Cited by 1
Distributed Learning of Average Belief Over Networks Using Sequential ObservationsPreprint
Zhang, K., Liu, Y., Liu, J. Y., et al. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1811.07799 · Cited by 1
First-order Methods with Convergence Rates for Multi-agent Systems on Semidefinite Matrix SpacesPreprint
Majlesinasab, N., Yousefian, F., & Feizollahi, M. J. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1902.05900 · Cited by 1
Distributed Optimal Power Flow Algorithms Over Time-Varying Communication NetworksPreprint
Zholbaryssov, M., & Domínguez-García, A. D. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1904.11559 · Cited by 5
On linear convergence of two decentralized algorithmsPreprint
Li, Y., & Yan, M. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1906.07225 · Cited by 1
“Another topic of interest is decentralized optimization over directed and dynamic graphs [14], [29]–[34].”
BackgroundDecentralized Online Optimization with Global Objectives and Local CommunicationPreprint
Lee, S., Nedić, A., & Raginsky, M. (2015) · arXiv (Cornell University) · Cited by 2
Self-citationTime-varying constrained proximal type dynamics in multi-agent network gamesPreprint
Cenedese, C., Belgioioso, G., Grammatico, S., et al. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1911.08443 · Cited by 1
Byzantine-Robust Decentralized Stochastic Optimization over Static and Time-Varying NetworksPreprint
Peng, J., Li, W., & Ling, Q. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2005.06276 · Cited by 1
“Some of the recent works further consider that the time-varying networks are directed such that the designed mixing matrices are column stochastic [22, 23, 24] or row stochastic [25].”
BackgroundAsynchrony-Resilient and Privacy-Preserving Charging Protocol for Plug-in Electric VehiclesPreprint
Zhang, Y., Liu, F., Wang, Z., et al. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2005.12519 · 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.