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 1,001–1,100 of 1,226
Distributed Stochastic Optimization With Unbounded Subgradients Over Randomly Time-Varying NetworksPreprint
Chen, Y., Fradkov, A. L., Fu, X., et al. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2008.08796 · Cited by 1
Consensus with Preserved Privacy against Neighbor CollusionPreprint
Zhang, S., Timoudas, T. O., & Dahleh, M. A. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2011.09646 · Cited by 1
Li, W., Assaad, M., & Zheng, S. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2104.09387 · Cited by 1
Doostmohammadian, M., Aghasi, A., & Rabiee, H. R. (2024) · RSI International Conference on Robotics and Mechatronics (ICRoM) · doi:10.1109/icrom64545.2024.10903613 · Cited by 3
Garg, K., Baranwal, M., Hero, A. O., & Panagou, D. (2019) · arXiv (Cornell University) · Cited by 2
A Distributed Parallel Optimization Algorithm via Alternating Direction Method of MultipliersPreprint
Liu, Z., Guo, F., Wang, W., et al. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2111.10494 · Cited by 1
Variable Metric Primal-Dual Method for Convex Optimization Problems with Changing ConstraintsPreprint
Konnov, I. V. (2022) · doi:10.24108/preprints-3112463 · Cited by 1
Decentralized convex optimization over time-varying graphs: a surveyPreprint
Rogozin, A., Gasnikov, A. V., Beznosikov, A., & Kovalev, D. A. (2022) · arXiv (Cornell University) · doi:10.48550/arxiv.2210.09719 · Cited by 8
“These results were generalized to directed graphs in [42].”
ResultInteraction-Based Distributed Learning in Cyber-Physical and Social Networks
Sasso, F., Coluccia, A., & Notarstefano, G. (2019) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2019.2917715
Nash Equilibrium Seeking in Subnetwork Zero-Sum Games with Switching Communication Graphs.Preprint
Lou, Y., Hong, Y., Xie, L., Shi, G., & Johansson, K. H. (2013) · arXiv (Cornell University)
In-situ Data Analytics In Cyber-Physical Systems
Zhao, L. (2016) · Digital Archive @ GSU · doi:10.57709/8501627
Ye, M. (2016) · DR-NTU (Nanyang Technological University) · doi:10.32657/10356/67002
Zaslavski, A. J. (2016) · Springer optimization and its applications · doi:10.1007/978-3-319-33255-0_10
Parallel algorithms for robust convex programs over networks
You, K., & Tempo, R. (2016) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.1109/acc.2016.7525215
A fast algorithm for distributed optimization over directed networks
Zeng, J., & He, T. (2016) · IEEE International Conference on Cyber Technology in Automation, Control, and Intelligent Systems · doi:10.1109/cyber.2016.7574793
Distributed Online Optimization on time-varying networks
Varnousfaderani, A., & Mohammad, M. (2015) · QSpace (Queen's University Library)
Decentralized State Estimation using Robotic Sensor Networks
Freundlich, C. (2016) · DukeSpace (Duke University)
Optimization over directed graphs: Linear convergence rate
Xi, C., & Khan, U. A. (2017) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp.2017.7952958
Sampling and Reconstruction of Spatial Signals
Cheng, C. (2017) · Journal of International Crisis and Risk Communication Research
Push-sum Algorithm on Time-varying Random Graphs
Rezaeinia, P. (2017) · QSpace (Queen's University Library)
Stochastic Methods in Distributed Optimization and Game-Theoretic Learning
Tatarenko, T. (2017) · Springer eBooks · doi:10.1007/978-3-319-65479-9_4 · Cited by 1
Game Theory and Multi-Agent Optimization
Tatarenko, T. (2017) · Springer eBooks · doi:10.1007/978-3-319-65479-9_2
Distributed convex optimization with a row-stochastic matrix over directed graphs
Zhang, Y., Lü, Q., Li, H., & Zhang, H. (2017) · International Workshop on Complex Systems and Networks (IWCSN) · doi:10.1109/iwcsn.2017.8276535 · Cited by 1
Novel consensus strategies applied to spacecraft formation flight
Paita, F. (2017) · UPCommons institutional repository (Universitat Politècnica de Catalunya) · doi:10.5821/dissertation-2117-113301
Random Asynchronous Iterations in Distributed Coordination AlgorithmsPreprint
Chen, Y., Xia, W., Cao, M., et al. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1804.10554
Robust cooperative control and optimization of multi-agent systems
Sun, C. (2018) · DR-NTU (Nanyang Technological University) · doi:10.32657/10356/75806
Pang, C. H. J. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1806.07734
SUBGRADIENT PROJECTION OVER DIRECTED GRAPHS USING SURPLUS CONSENSUS
Xin, R., Xi, C., & Khan, U. A. (2018) · IEEE Data Science Workshop (DSW) · doi:10.1109/dsw.2018.8439884
A Proximal Gradient Algorithm for Composite Consensus Optimization over Directed Graphs
Zeng, J., He, T., Ouyang, S., Wang, M., & Chang, X. (2017) · IEEE International Conference on Cyber Technology in Automation, Control, and Intelligent Systems · doi:10.1109/cyber.2017.8446454
Distributed Algorithms in Networks of Agents under Communication Constraints
Chen, X., Dong, J., & Zhou, G. (2018) · Chinese Control Conference (CCC) · doi:10.23919/chicc.2018.8484137
Distributed Optimization in Discrete-time Multi-Agent Systems with Independent Step Size
Lian, J., & Chen, Y. (2018) · Annual Conference of the Society of Instrument and Control Engineers of Japan (SICE) · doi:10.23919/sice.2018.8492556
Hayashi, N., & Nagahara, M. (2019) · IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences · doi:10.1587/transfun.e102.a.351
Distributed Algorithms for Computing a Common Fixed Point of a Group of Nonexpansive OperatorsPreprint
Li, X., & Feng, G. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1902.02481
Kajiyama, Y., Hayashi, N., & Takai, S. (2019) · IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences · doi:10.1587/transfun.e102.a.343
Distributed Machine Learning over Directed Network with Fixed Communication Delays
Guo, Z. (2019) · International Conference on Machine Learning and Computing (ICMLC) · doi:10.1145/3318299.3318340
Gradient-Free Multi-Agent Nonconvex Nonsmooth OptimizationPreprint
Hajinezhad, D., & Zavlanos, M. M. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1904.04650
A Fast Proximal Gradient Algorithm for Decentralized Composite Optimization over Directed NetworksPreprint
Zeng, J., He, T., & Wang, M. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1609.03784
Exponential Convergence of a Distributed Algorithm for Solving Linear Algebraic EquationsPreprint
Liu, J. Y., Morse, A. S., Nedić, A., et al. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1701.00554
Self-citationBaron-Prada, E., Uribe, C. A., & Mojica‐Nava, E. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1809.00712
Preserving Data-Privacy with Added Noises: Optimal Estimation and Privacy AnalysisPreprint
He, J., Cai, L., & Guan, X. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1703.06212
Newton-Raphson Consensus for Distributed Convex OptimizationPreprint
Varagnolo, D., Zanella, F., Cenedese, A., et al. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1511.01509
Distributed Training with Mobile Agents: Optimization Over Dynamic Directed Graphs
Saadatniaki, F., Xin, R., & Khan, U. A. (2019) · IEEE Data Science Workshop (DSW) · doi:10.1109/dsw.2019.8755589
Distributed Stochastic Algorithm for Convex Optimization Over Directed Graphs
Cheng, S., Liang, S., & Hong, Y. (2019) · Chinese Control and Decision Conference (CCDC) · doi:10.1109/ccdc.2019.8833165
Distributed Min-max Optimization over Digraphs
Xie, P., You, K., & Wu, C. (2019) · Chinese Control and Decision Conference (CCDC) · doi:10.1109/ccdc.2019.8832607
An initialization-free continuous-time distributed algorithm for convex optimization problem
Ding, L., Shi, X., Zheng, R., & Gang-feng, Y. (2019) · Chinese Control and Decision Conference (CCDC) · doi:10.1109/ccdc.2019.8832421
A Distributed Algorithm for Economic Dispatch with Packet Drops and Time Delays on Digraph
Wang, T., & Chen, G. (2019) · Chinese Control and Decision Conference (CCDC) · doi:10.1109/ccdc.2019.8833171
Corrected Gradient Methods for Distributed optimization
Qiu, Z., Xie, L., & You, K. (2019) · Chinese Control Conference (CCC) · doi:10.23919/chicc.2019.8866156
Distributed Push-Sum Algorithm for Multi-Agent optimization Via One-Point Gradient Estimator
Wang, C., Yuan, D., & Zhang, B. (2019) · Chinese Control Conference (CCC) · doi:10.23919/chicc.2019.8865859
Asynchronous Subgradient-push Algorithm for Distributed optimization over Directed Graphs
Zhang, J., & You, K. (2019) · Chinese Control Conference (CCC) · doi:10.23919/chicc.2019.8866497
Distributed Stochastic Block Coordinate Descent for Time-Varying Multi-Agent OptimizationPreprint
Yu, Z., & Ho, D. W. C. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1912.13222
Distributed Collaborative 3D-Deployment of UAV Base Stations for On-Demand CoveragePreprint
Kimura, T., & Ogura, M. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2002.05339
Schnelle, verteilte Optimierungsmethoden und spieltheoretische Ansätze in vernetzten Systemen
Tatarenko, T. (2020) · at - Automatisierungstechnik · doi:10.1515/auto-2019-0080
Accelerated Distributed Optimization over Directed Graphs with Row and Column-Stochastic Matrices
Hu, J., Zhu, Y., Li, H., & Wang, Z. (2019) · IEEE Symposium Series on Computational Intelligence (SSCI) · doi:10.1109/ssci44817.2019.9002658
Fullmer, D., Liu, J., & Morse, A. S. (2019) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc40024.2019.9028968
Mo, L., Hu, H., Yu, Y., et al. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2005.01079
“When the directed communication graph was unbalanced, the authors of [21] combined the subgradient algorithm and push-sum mechanism to deal with the time-varying network optimization problem and also gave the convergence rate of the proposed algorithm.”
MethodOperator Sliding and Decentralized Optimization
Lan, G. (2020) · Springer series in the data sciences · doi:10.1007/978-3-030-39568-1_8
Distributed Economic Dispatch in Smart Grids: General Unbalanced Directed Network
Li, H., Lü, Q., Wang, Z., et al. (2020) · Springer eBooks · doi:10.1007/978-981-15-6109-2_9
Hashimoto, W., Hayashi, N., Hara, N., & Takai, S. (2020) · Transactions of the Society of Instrument and Control Engineers · doi:10.9746/sicetr.56.395
Online decentralized decision making with inequality constraints: an ADMM approachPreprint
Chen, Y., Santillo, M., Janković, M., et al. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2011.10023
“3044873 topologies and time delays have also been considered in the literature [2], [4].”
Distributed Subgradient Algorithm for Multi-agent Optimization with Uncoordinated Dynamic Stepsizes
Ren, X., Li, D., Xi, Y., & Shao, H. (2020) · International Conference on Control and Automation · doi:10.1109/icca51439.2020.9264511
“In many prior works on subgradient-related distributed methods [9]–[11], [20]– [23], stepsizes for subgradients should follow a decaying rule such as be positive, vanishing, non-summable but square summable.”
BackgroundAccelerated Distributed Optimization over Digraphs with Stochastic Matrices
Wang, H., Li, H., & Zhou, B. (2021) · Springer eBooks · doi:10.1007/978-981-33-4528-7_4
Linear Convergence for Constrained Optimization Over Time-Varying Digraphs
Wang, H., Li, H., & Zhou, B. (2021) · Springer eBooks · doi:10.1007/978-981-33-4528-7_5
Cooperative Optimization with Nonconvex Input Constraints and Dynamically Changing Graphs
Shen, X. (2020) · Chinese Automation Congress · doi:10.1109/cac51589.2020.9327255
Gradient-free distributed optimization and nash equilibrium seeking
Pang, Y. (2020) · DR-NTU (Nanyang Technological University) · doi:10.32657/10356/143354
Byzantine-resilient decentralized learning
Yang, Z. (2020) · doi:10.7282/t3-817e-1d43
Multi-agent network games with applications in smart electric mobility
Cenedese, C. (2021) · University of Groningen research database (University of Groningen / Centre for Information Technology) · doi:10.33612/diss.166885555
Gradient-Consensus Method for Distributed Optimization in Directed NetworksPreprint
Khatana, V., Saraswat, G., Patel, S., & Salapaka, M. V. (2019) · arXiv (Cornell University) · Cited by 1
Online decentralized decision making with inequality constraints: An ADMM approach
Chen, Y., Santillo, M., Janković, M., et al. (2021) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.23919/acc50511.2021.9483302
A unified framework for distributed optimization algorithms over time-varying directed graphsPreprint
Choi, W., Kim, D., & Yun, S.-B. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2108.02132
Distributed smooth optimisation with event-triggered proportional-integral algorithms
Yao, L., Wei, Y., & Fu, S. (2021) · International Journal of Control · doi:10.1080/00207179.2021.1970816
Distributed Learning in Non-Convex World: Theory, Algorithms, and Applications
Sun, H. (2021) · University of Minnesota Digital Conservancy (University of Minnesota)
Decentralized Pairwise-Workloads Balancing Algorithm for Networked Multi-agent Systems
Wang, X., Zhou, Q., Sun, C., et al. (2021) · Chinese Control Conference (CCC) · doi:10.23919/ccc52363.2021.9550516
A Primal-Dual Algorithm for Distributed Stochastic Optimization with Equality Constraints
Du, K., & Chen, X. (2021) · Chinese Control Conference (CCC) · doi:10.23919/ccc52363.2021.9549801
“Other ways to consider a specific network topology, such as pushsum method for time-varying directed graphs [6], have also received increasing attention recently.”
BackgroundAn Accelerated Distributed Online Gradient Push-Sum Algorithm in Time-varying Networks
Fang, R., Li, D., & Shen, X. (2021) · Chinese Control Conference (CCC) · doi:10.23919/ccc52363.2021.9550355
Distributed Optimization Design of Multi-Agent Systems With Nonidentical Packet Losses
Ma, J., Yu, X. P., & Lan, W. (2021) · Chinese Control Conference (CCC) · doi:10.23919/ccc52363.2021.9550553
Meng, Z., Yang, T., & Johansson, K. H. (2012) · Systems & control · doi:10.1007/978-3-030-84682-4_13
Distributed algorithm for non-convex stochastic optimization with variance reduction.Preprint
Jiang, X., Zeng, X., Sun, J. Q., & Chen, J. (2021) · arXiv (Cornell University)
Gradient-push algorithm for distributed optimization with event-triggered communicationsPreprint
Kim, J., & Choi, W. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2111.06315
Zhang, J., Liu, L., Wang, X., et al. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2111.08482
Quantizer-based distributed mirror descent for multi-agent convex optimization
Xiong, M., Zhang, B., & Yuan, D. (2021) · Chinese Control and Decision Conference (CCDC) · doi:10.1109/ccdc52312.2021.9602370
Distributed Methods with Stochastic Communication
Ananduta, W. (2021) · Springer theses · doi:10.1007/978-3-030-89803-8_5
Distributed multi-agent consensus under constraints
Qiu, Z. (2017) · DR-NTU (Nanyang Technological University) · doi:10.32657/10356/72344
Ran, L., Wang, C., Zheng, L., Li, H., & Wang, Z. (2022) · Optimal Control Applications and Methods · doi:10.1002/oca.2886
Mission Level Uncertainty in Multi-Agent Resource Allocation
Konda, R., Chandan, R., & Marden, J. R. (2021) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc45484.2021.9683156
Time-varying dual accelerated gradient ascent: A fast network optimization algorithm
Monifi, E., & Mahdavi‐Amiri, N. (2022) · Journal of Parallel and Distributed Computing · doi:10.1016/j.jpdc.2022.03.014
Sampling-based Distributed Hybrid Optimization for Multi-agent Systems
Tan, X., & Cao, J. (2022) · Asian Control Conference (ASCC) · doi:10.23919/ascc56756.2022.9828085
An Improved Distributed Optimization Algorithm over Unbalanced Directed Graph
Gao, Z., & Mo, L. (2022) · Lecture notes in electrical engineering · doi:10.1007/978-981-19-3998-3_49
On Distributed Optimization Over Random Independent Networks
Aghajan, A., & Touri, B. (2022) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.23919/acc53348.2022.9867471 · Cited by 2
“Lemma 5 ( [15]): Under Assumption 1, for all v ∈ R, we have”
BackgroundMethodDistributed State Estimation for Nonlinear Systems with Unknown Parameters
Heredia, P., García, E., & Mou, S. (2022) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.23919/acc53348.2022.9867771
Decentralized Multi-Agent Policy Evaluation Over Directed Graphs
Lin, Q., & Ling, Q. H. (2022) · Chinese Control Conference (CCC) · doi:10.23919/ccc55666.2022.9902191
Wang, D., Zhou, J., Zheng, W. X., et al. (2022) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc51059.2022.9992866
Event-Triggered Algorithms for Distributed Convex Optimization
Lü, Q., Liao, X., Li, H., Deng, S., & Gao, S. (2022) · Wireless networks · doi:10.1007/978-981-19-8559-1_4
Accelerated Algorithms for Distributed Convex Optimization
Lü, Q., Liao, X., Li, H., Deng, S., & Gao, S. (2022) · Wireless networks · doi:10.1007/978-981-19-8559-1_1
Primal–Dual Algorithms for Distributed Economic Dispatch
Lü, Q., Liao, X., Li, H., Deng, S., & Gao, S. (2022) · Wireless networks · doi:10.1007/978-981-19-8559-1_7
Proximal Algorithms for Distributed Coupled Optimization
Lü, Q., Liao, X., Li, H., Deng, S., & Gao, S. (2022) · Wireless networks · doi:10.1007/978-981-19-8559-1_3
Privacy Preserving Algorithms for Distributed Online Learning
Lü, Q., Liao, X., Li, H., Deng, S., & Gao, S. (2022) · Wireless networks · doi:10.1007/978-981-19-8559-1_9 · Cited by 1
Edge-based event-triggered distributed inexact gradient descent for convex optimization
Luo, D., Xiong, M., Zhang, B., et al. (2022) · China Automation Congress (CAC) · doi:10.1109/cac57257.2022.10055550
Decentralized Multiobjective Optimization Algorithms
Blondin, M. J. (2022) · Springer eBooks · doi:10.1007/978-3-030-54621-2_797-1
Wu, X., Sou, K. C., & Lu, J. (2023) · Optimization methods & software · doi:10.1080/10556788.2023.2189713
Quantized Gradient Descent Algorithm for Distributed Nonconvex Optimization
YOSHIDA, J., Hayashi, N., & Takai, S. (2023) · IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences · doi:10.1587/transfun.2023eap1020
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.