Achieving Geometric Convergence for Distributed Optimization Over Time-Varying Graphs
Open accessThe DOI matches its Crossref record; 89 of the 89 references it cites were found in a registry or an index; 10 of the 34 sources its claims cite were checked for support.
Abstract
This paper considers the problem of distributed optimization over time-varying graphs. For the case of undirected graphs, we introduce a distributed algorithm, referred to as DIGing, based on a combination of a distributed inexact gradient method and a gradient tracking technique. The DIGing algorithm uses doubly stochastic mixing matrices and employs fixed step-sizes and, yet, drives all the agents' iterates to a global and consensual minimizer. When the graphs are directed, in which case the implementation of doubly stochastic mixing matrices is unrealistic, we construct an algorithm that incorporates the push-sum protocol into the DIGing structure, thus obtaining the Push-DIGing algorithm. Push-DIGing uses column stochastic matrices and fixed step-sizes, but it still converges to a global and consensual minimizer. Under the strong convexity assumption, we prove that the algorithms converge at R-linear (geometric) rates as long as the step-sizes do not exceed some upper bounds. We establish explicit estimates for the convergence rates. When the graph is undirected it shows that DIGing scales polynomially in the number of agents. We also provide some numerical experiments to demonstrate the efficacy of the proposed algorithms and to validate our theoretical findings.
Overview
CoChat Summary
TL;DR
The paper introduces DIGing for distributed optimization over time-varying undirected graphs and Push-DIGing for time-varying directed graphs, both using fixed step-sizes and gradient tracking. Under strong convexity and smoothness, it proves global R-linear (geometric) convergence and gives explicit rate bounds.
Key findings
- DIGing uses doubly stochastic mixing matrices and fixed step-sizes; under Assumptions 1, 4, and 5, it converges to the unique optimum at a global R-linear rate \(O(\lambda^k)\) for step-sizes \(\alpha \in (0, 1.5(1-\delta)^2 \bar{\mu} J_1]\).
- Push-DIGing incorporates the push-sum protocol with column stochastic matrices and fixed step-sizes; under Assumptions 4–7, it also converges at a global R-linear rate \(O(\lambda^k)\) for \(\alpha \in (0, 1.5(1-\delta)^2 \bar{\mu} J_2]\).
- For undirected graphs, Corollary 11 gives iteration complexity \(O(\tau^{-2} B^3 n^{4.5} \bar{\kappa}^{1.5} \ln(1/\varepsilon))\), polynomial in the number of agents \(n\). For lazy Metropolis mixing on time-invariant connected undirected graphs, Corollary 12 gives rate \(\lambda = 1 - 1/(161312\, n^{4.5} \bar{\kappa}^{1.5})\) and iteration complexity \(O(n^{4.5} \bar{\kappa}^{1.5} \ln(1/\varepsilon))\).
- Numerical experiments with \(n=12\), \(m_i=1\), \(p=3\), and Huber loss show DIGing and variants have R-linear rates, while the push-gradient method has only sublinear rate; DIGing-ATC is faster in iterations than DIGing but has higher per-iteration communication cost, and Push-DIGing can be as fast as DIGing-ATC at half communication cost per iteration.
Methods
- The paper studies distributed convex optimization \(\min \sum_{i=1}^n f_i(x)\) over time-varying undirected and directed graphs, assuming smoothness with Lipschitz gradients and strong convexity of at least one local function.
- It proposes DIGing: \(x(k+1)=W(k)x(k)-\alpha y(k)\), \(y(k+1)=W(k)y(k)+\nabla f(x(k+1))-\nabla f(x(k))\), and Push-DIGing, which adds push-sum variables \(u,v,V\) and uses column stochastic matrices.
- Convergence analysis uses the small-gain theorem with an ergodic norm and a cycle of arrows \(q \to z \to \check{y} \to \check{x} \to q\); numerical experiments compare push-gradient, DIGing, DIGing-ATC, and Push-DIGing on time-invariant directed, time-varying undirected, and time-varying directed graphs.
Limitations
- The paper states an open question is obtaining improved estimates on convergence rates, especially scaling with the number of agents \(n\), and extensions to local constraints and couplings among agents.
- Step-size selection requires agents to agree on common upper bounds on \(n\) and \(B\), plus lower \(\bar{\mu}\) and upper \(L\); the paper assumes all agents use the same step-size, though it notes uncoordinated step-sizes are possible in subsequent work.
- The paper states its bounds on step-sizes are often conservative and uses hand-optimized step-sizes in experiments; the numerical experiments use a small network of \(n=12\), so the empirical validation is limited in scale.
Model-written summary. Check it against the paper before relying on it.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
9 Valid · 0 Not valid · 10 Not checked · 37 Own results and interpretations
The cited sources support only part of this claim — read each source’s verdict below.
In the paper
“This compares favorably to some of the existing literature, e.g., [70,76], which require detailed spectral information about the network for step-size selection.”
What the sources say
- Supportedcites [70] C. Xi and U. Khan, On the Linear Convergence of Distributed Optimization over Directed Graphs , preprint,arXiv:1510.02149, 2015. source
The part of the sentence this citation is offered for — that the cited work's step-size selection needs detailed spectral information about the network — is borne out by our copy: Theorem 1 (p. 13) sets α_min and α_max in terms of λ_min(M+M^⊤), d_- and d_∞, and the discussion after it (p. 14) states outright that 'the values of α and ᾱ need the knowledge of the network topology, which may not be available in a distributed manner,' flagging avoidance of that global knowledge as an open question. Section VI (p. 22) demonstrates the requirement in practice, computing λ_max/λ_min of H_i^⊤H_i, the degree constants and λ_min(M+M^⊤) to estimate the interval [9.6×10^-4, 0.26] before picking α = 0.1. The comparative framing ('compares favorably') is the citing authors' own conclusion and is not attributed to this source, so it is not judged here. (LLM, conf=0.85)
- Partly supportedcites [76] J. Zeng and W. Yin, ExtraPush for Convex Smooth Decentralized Optimization over Directed Networks , preprint,arXiv:1511.02942, 2015. sourceExperimental — accuracy not yet measured
Theorem 4 (p. 8) gives a condition on the step size, and the discussion on p. 9 relates the convergence bound to eigenvalues of network-derived matrices. But p. 9 calls the step-size condition sufficient, not necessary, and §6.1 (p. 12) selects step sizes by hand. The paper therefore supports a spectral dependence in its theoretical bound, not the categorical claim that step-size selection requires detailed spectral information. (LLM, conf=0.79)
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.
- Supported
Every source the paper cites for this claim was checked and supports it.
In the paper
“Proposition 1 ( [62]). Assume null { I -W } = span { 1 } where W ∈ R n × n . If x ∗ satisfies conditions: (i) x ∗ = Wx ∗ (consensus), (ii) 1 ⊤ ∇ f ( x ∗ ) = 0 (optimality), then the rows of x ∗ are the same as each other and the transpose of each row is an optimal solution of the problem (1) .”
What the sources say
- Supportedcites [62] matched to “EXTRA: An Exact First-Order Algorithm for Decentralized Consensus Optimization” (2015) source
The paper’s discussion of Proposition 2.1 (p. 6) says that, under null{I−W} = span{1}, a point satisfying its consensus and optimality conditions has identical rows that solve problem (1.1). Lemma 3.1’s proof (p. 9) identifies 1ᵀ∇f(x*) = 0 as the optimality condition. The citing proposition paraphrases those conditions and conclusion. (LLM, conf=0.92)
plainstates 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.
- Supported
Every source the paper cites for this claim was checked and supports it.
In the paper
“While the subgradient-push eliminates the requirement of graph balancing [22], it suffers from a slow sublinear 2 convergence rate even for strongly convex smooth functions due to its employment of diminishing step-size [41].”
What the sources say
- Supportedcites [41] A. Nedić and A. Olshevsky, Stochastic Gradient-Push for Strongly Convex Functions on Time-Varying Directed Graphs , preprint, arXiv:1406.2075, 2014. source
The paper reports an O((ln t)/t) rate for strongly convex functions with Lipschitz gradients using an appropriately chosen diminishing step-size (main-result passage; page unavailable). This is sublinear, although the Introduction and Conclusion emphasize that it improves on the earlier O((ln t)/√t) rate and is close to the best achievable rate in the noisy setting; “slow” is the citing authors’ characterization. (LLM, conf=0.85)
plainstates 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.
- Supported
Every source the paper cites for this claim was checked and supports it.
In the 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.”
What the sources say
- Supportedcites [42] matched to “Distributed Optimization Over Time-Varying Directed Graphs” (2015) source
In II. Problem, Algorithm and Main Results (p. 2), the paper calls its connectivity assumption typical and says it is considerably weaker than requiring each graph to be connected, because the necessary edges can appear over time. (LLM, conf=0.91)
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.
- Supported
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
“When the graph is undirected it shows that DIGing scales polynomially in the number of agents.”
- Also stated in: § ACHIEVING GEOMETRIC CONVERGENCE FOR DISTRIBUTED OPTIMIZATION OVER TIME-VARYING GRAPHS ∗ · p. 4 · plain
“Moreover, we show that the convergence rate of DIGing scales polynomially in the total number of agents in the network.”
plainstates 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 2 assumptions not shown here.
- Also stated in: § ACHIEVING GEOMETRIC CONVERGENCE FOR DISTRIBUTED OPTIMIZATION OVER TIME-VARYING GRAPHS ∗ · p. 4 · plain
25 more claims
Create a free account to see all 56 claims and to verify the 2 references still open.
- It may state two separate claims as one. 13
- Probably not a substantial claim. 14
- The quote only partly states this claim. 1
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
§ Algorithm 2: Push-DIGing · p. 21
“N out i ( k ) is the set of agents that can receive the information from agent i (in-neighbors of agent i ) at time k .”
§ Algorithm 2: Push-DIGing · p. 21
“N out i ( k ) = { j ∣ ∣ ( - → i, j ) ∈ A ( k ) }”
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
§ Algorithm 1: DIGing · p. 10
“the gradients are close to zero in the neighborhood of the optimal point”
§ ACHIEVING GEOMETRIC CONVERGENCE FOR DISTRIBUTED OPTIMIZATION OVER TIME-VARYING GRAPHS ∗ · p. 5
“not necessarily a point where ∇ f i ( x ) = 0 ∀ i”
Citations
Cites
Boyd, S., Parikh, N., Chu, E., Peleato, B., & Eckstein, J. (2011) · Foundations and Trends® in Machine Learning · doi:10.1561/2200000016 · Cited by 17,075
Boyd, S. (2010) · now publishers, Inc. eBooks · doi:10.1561/9781601984616 · Cited by 12,677
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×
“References [60–62] use a difference structure to cancel the steady state error in decentralized gradient descent [47, 75], thereby developing the algorithm EXTRA and its proximal-gradient variant.”
MethodFast linear iterations for distributed averaging
Xiao, L., & Boyd, S. (2004) · Systems & Control Letters · doi:10.1016/j.sysconle.2004.02.022 · Cited by 2,706
Markov Chains and Mixing Times
Levin, D., Peres, Y., & Wilmer, E. (2008) · doi:10.1090/mbk/058 · Cited by 2,241
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 · cited 4×
“Instead, if every agent knows its out-degree, it is possible for the agents to construct a column stochastic matrix C and perform the following recursions with initialization u(0) = x(0) and v(0) = 1 to achieve the average (push-sum protocol [27]):”
BackgroundMethodInfluentialEXTRA: An Exact First-Order Algorithm for Decentralized Consensus Optimization
Shi, W., Ling, Q., Wu, G., & Yin, W. (2015) · SIAM Journal on Optimization · doi:10.1137/14096668x · Cited by 1,261
Self-citationDistributed Optimization Over Time-Varying Directed Graphs
Nedic, A., & Olshevsky, A. (2015) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2014.2364096 · Cited by 1,187
Self-citationDistributed average consensus with least-mean-square deviation
Xiao, L., Boyd, S., & Kim, S.-J. (2007) · Journal of Parallel and Distributed Computing · doi:10.1016/j.jpdc.2006.08.010 · Cited by 1,107 · cited 1×
“Some examples include distributed averaging [7,50,72], distributed spectrum sensing [1], formation control [49, 58], power system control [21, 55], statistical inference and learning [20, 45, 53].”
Background
Research works printed but not linked: 9
- Chen A., 2012, Allerton, 601
- Di Lorenzo P., 2015, Proceedings of the IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing, 229
- Forero P., 2010, J. Mach. Learn. Res., 59, 1663
- Mokhtari A., 2016, J. Mach. Learn. Res., 17, 1
- Nedić A., 2008, UK, 3
- A. Olshevsky, Efficient Information Aggregation Strategies for Distributed Control and Signal Processing , Ph.D. thesis, Massachusetts Institute of Technology, 2010.
- Rabbat M., 2004, New York, 20
- Ram S., 2009, Proceedings of INFOCOM, 3001
- Sayed A., 2013, New York, 323
Cited by
Items 401–500 of 1,070
Removing Data Heterogeneity Influence Enhances Network Topology Dependence of Decentralized SGDPreprint
Yuan, K., Alghunaim, S. A., & Huang, X. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2105.08023 · Cited by 37
“…have been proposed to address this issue, such as alternating direction method of multipliers (ADMM) methods [37, 38], explicit bias-correction methods (such as EXTRA [39], Exact-Diffusion [20, 21], NIDS [22], and gradient tracking [24, 25, 26, 27] – see [40]), and dual acceleration [41, 42, 43].”
BackgroundMethodBlueFog: Make Decentralized Algorithms Practical for Optimization and Deep LearningPreprint
Ying, B., Yuan, K., Hu, H., Chen, Y., & Yin, W. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2111.04287 · Cited by 35
“Various primal-dual algorithms come out to further speed up the convergence, and they are based on alternating direction method of multipliers (ADMM) [45], [46], explicit bias-correction [47], [48], [49], gradient tracking [23], [24], [25], [26], and dual acceleration [50], [51].”
BackgroundMethodDistributed Optimization With Personalization: A Flexible Algorithmic Framework
Huang, Y. T., Xu, J., Meng, W., Wai, H.-T., & Chai, L. (2024) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2024.3381889 · Cited by 10
“…have been recently proposed in distributed optimization community as a key step to eliminate the effects of data heterogeneity among a network of nodes [18], [44], [45], [46], [47], [48], where an auxiliary variable is introduced for each node to track the average gradients of local functions.”
BackgroundMethodA Continuous-Time Gradient-Tracking Algorithm for Directed Networks
Dhullipalla, M. H., & Chen, T. (2024) · IEEE Control Systems Letters · doi:10.1109/lcsys.2024.3417856 · Cited by 9
“This has lead to an upsurge of research involving distributed gradient-tracking methods: i) for undirected networks in [8], [10], [11], ii) for directed networks in [9], [12], [13], and iii) for time-varying networks in [14].”
BackgroundDistributed Quasi-Newton Method for Multi-Agent Optimization
Shorinwa, O., & Schwager, M. (2024) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2024.3424436 · Cited by 15
“896e − 2 DIGing-ATC [19] 1 .”
MethodTopology Design and Graph Embedding for Decentralized Federated Learning
Duan, Y., Li, X., & Wu, J. (2024) · Intelligent and Converged Networks · doi:10.23919/icn.2024.0008 · Cited by 10
Projected Push-Pull for Distributed Constrained Optimization Over Time-Varying Directed Graphs
Akgün, O. E., Dayı, A. K., Gil, S., & Nedić, A. (2024) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.23919/acc60939.2024.10644202 · Cited by 15
“geometric convergence in undirected [4], [6], [7] and directed graphs [7]–[10].”
BackgroundSelf-citationLiu, H., Yu, W., Wen, G., et al. (2024) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2024.3469048 · Cited by 9
“Togetaclearoverviewofthestateoftheart,TableI presentsadetailedcomparisonoftheresultsin[10],[11],[12], [13], [14], [15], [16], [17], [18], [19], [20], [21], [22], [23], [24], [25], [26], and [27].”
Lin, Y., Li, W., Zhang, B., & Du, J. (2024) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2024.3492329 · Cited by 13
“…utilized in the above algorithms, a few Diging-like algorithms are also proposed with uncoordinated step sizes in [11] and [12] via adapt-then-combine (ATC) structure, and a notable advantage of the ATC structure is that algorithms with this structure achieve faster convergence than CTA [9], [12].”
Distributed Online Optimization Of Consensus-Based Adaptive Gradients Over Time-Varying Networks
Sheng, Q., Shi, X., & Su, Y. (2025) · IEEE Transactions on Industrial Cyber-Physical Systems · doi:10.1109/ticps.2025.3538690 · Cited by 9
“Ontheotherhand,Push-Summethod[19],Push-DIGing[16],andTV-AB[20]arerecentlyproposedoptimiza- tionalgorithmsthatcanbeusedfortime-varyingdirectednet-works.”
Yang, Z., He, W., & Yang, S. (2025) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2025.3544517 · Cited by 13
“…vectors s 1 , s 2 ∈ R u , there exist positive constants δ and β such that: Remark 1: Assumption 1 implies a unique optimal solution to problem (1) and is also a standard assumption for achieving first-order distributed optimization algorithms with linear convergence rates [8], [9], [10], [11].”
InfluentialExact diffusion strategy for optimization by networked agents
Yuan, K., Ying, B., Zhao, X., & Sayed, A. H. (2017) · European Signal Processing Conference (EUSIPCO) · doi:10.23919/eusipco.2017.8081185 · Cited by 7
“In the second experiment, we compare exact diffusion with EXTRA consensus [9], DIGing [10], and Aug-DGM [11].”
BackgroundMethodInfluentialDOT and DOP: Linearly Convergent Algorithms for Finding Fixed Points of Multiagent Operators
Li, X., Meng, M., & Xie, L. (2023) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2023.3312137 · Cited by 12
ET-DASG: An Efficient Decentralized Algorithm for Convex Optimization Over Networks
Lü, Q., Liao, X., Deng, S., & Li, H. (2022) · IEEE Transactions on Network Science and Engineering · doi:10.1109/tnse.2022.3153386 · Cited by 10
Linear Convergence of ADMM Under Metric Subregularity for Distributed Optimization
Pan, X., Liu, Z., & Chen, Z. (2022) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2022.3185178 · Cited by 12
A Decentralized Primal-Dual Framework for Non-Convex Smooth Consensus Optimization
Mancino-Ball, G., Xu, Y., & Chen, J. (2023) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2023.3239799 · Cited by 27
“Algorithms that handle different network structures from those considered here have also been considered: Push-Pull [42] handles directed graphs and DIGing [43] is a gradient tracking algorithm that works for network structures where W changes at every iteration.”
Distributed primal-dual optimisation method with uncoordinated time-varying step-sizes
liu, P. L., Li, H., Dai, X., & Han, Q. (2018) · International Journal of Systems Science · doi:10.1080/00207721.2018.1442886 · Cited by 10
“Lemma 4.2 (Nedic et al., 2017) : If || s i || γ is bounded for a constant γ ∈ ( 0 , 1 ) and for any sequence s i , then || s i || converges geometrically at a convergence rate O (γ k ) .”
BackgroundMethodInfluentialConvergence Rate of Distributed Subgradient Methods under Communication Delays
Doan, T. T., Beck, C. L., & Srikant, R. (2018) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.23919/acc.2018.8431382 · Cited by 11
Systematic Design of Decentralized Algorithms for Consensus Optimization
Han, S. (2019) · IEEE Control Systems Letters · doi:10.1109/lcsys.2019.2920342 · Cited by 12
“This should not come as a surprise, because the DIGing algorithm is based on consensus tracking of the average gradient.”
BackgroundMethodInfluentialBelgioioso, G., Nedić, A., & Grammatico, S. (2019) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc40024.2019.9029883 · Cited by 8
“In this context, the authors in [14] propose an elegant solution that relies on dynamic tracking, a technique extensively used in distributed optimization [15].”
Self-citationZimmermann, J., Tatarenko, T., Willert, V., & Adamy, J. (2020) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc42340.2020.9304360 · Cited by 12
“These methods, published for example in [7], [9] and [12], have The authors are with the Control Methods and Robotics Lab at TU Darmstadt, Germany.”
MethodDecentralized TD(0) With Gradient Tracking
Lin, Q., & Ling, Q. H. (2021) · IEEE Signal Processing Letters · doi:10.1109/lsp.2021.3071962 · Cited by 9
“The work of [9] considers deterministic optimization with gradient tracking over a static network while the work of [10] is over a time-varying network.”
BackgroundOn Primal-Dual Approach for Distributed Stochastic Convex Optimization over NetworksPreprint
Dvinskikh, D., Gorbunov, E., Gasnikov, A. V., Dvurechensky, P. E., & Uribe, C. A. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1903.09844 · Cited by 16
Distributed Nash equilibrium seeking for aggregative games via a small-gain approachPreprint
Liang, S., Yi, P., Hong, Y., et al. (2019) · arXiv (Cornell University) · Cited by 9
Revisiting EXTRA for Smooth Distributed OptimizationPreprint
Li, H., & Lin, Z. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2002.10110 · Cited by 9
“EXTRA (Shi et al., 2015a) and the gradient tracking based method (Xu et al., 2015; Qu & Li, 2017a) (also called DIGing in (Nedić et al., 2017)) can be seen as a trade-off between communications and computations, which need equal numbers of communications and gradient computations at each iteration.”
MethodDual-Free Stochastic Decentralized Optimization with Variance ReductionPreprint
Hendrikx, H., Bach, F., & Massoulié, L. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2006.14384 · Cited by 20
“Decentralized adaptations of gradient descent in the smooth and strongly convex setting include EXTRA [37], DIGing [28] or NIDS [21].”
BackgroundADOM: Accelerated Decentralized Optimization Method for Time-Varying NetworksPreprint
Kovalev, D. A., Shulgin, E., Richtárik, P., Rogozin, A., & Gasnikov, A. V. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2102.09234 · Cited by 15
“We do not compare ADOM with PANDA (Maros & Jaldén, 2018) and DIGing (Nedic et al., 2017) because they are not accelerated and have very slow convergence rate both in theory and practice.”
MethodInfluentialAccelerated Gradient Tracking over Time-varying Graphs for Decentralized OptimizationPreprint
Li, H., & Lin, Z. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2104.02596 · Cited by 42
Event-Based Hybrid Bi-Level Energy Management and Control Framework of Networked Microgrid
Wu, T., Wang, J., Zhao, T., et al. (2024) · IEEE Transactions on Smart Grid · doi:10.1109/tsg.2024.3486575 · Cited by 8
“Gradient-based distributed algorithms are primarily proposed for unconstrained optimization problems with convex objective functions [13], [14].”
Scalability for Multivehicle Coordination With Dial-a-Ride Application
Zhang, W., Hu, G., Zhang, H., & Wang, Y. (2025) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2025.3573251 · Cited by 9
“While less similar to distributed optimization using a time-dependent graph [27], apparently, there is a sharp difference in contrast to system (27).”
Sun, B., Hu, J., Xia, D., & Li, H. (2021) · Frontiers of Information Technology & Electronic Engineering · doi:10.1631/fitee.2000615 · Cited by 8
A Unified Framework for Continuous-Time Unconstrained Distributed Optimization
Touri, B., & Gharesifard, B. (2023) · SIAM Journal on Control and Optimization · doi:10.1137/21m1442711 · Cited by 12
“In fact, using a perturbed push-sum protocol, the work [22], and a large volume of references thereafter which we are unable to adequately review but point out particularly to [23] for geometric rates and to [30, 31] for random settings, provide a subgradient-push distributed optimization protocol, provably convergent…”
MethodA distributed consensus based algorithm for economic dispatch over time‐varying digraphs
Xu, K., Guo, F., & Yan, G. (2023) · IET Control Theory and Applications · doi:10.1049/cth2.12526 · Cited by 9
Suo, W., Li, W., Zhang, B., et al. (2023) · Journal of the Franklin Institute · doi:10.1016/j.jfranklin.2023.10.041 · Cited by 8
Energy-Efficient Connectivity-Aware Learning Over Time-Varying D2D Networks
Parasnis, R., Hosseinalipour, S., Chu, Y.-W., Chiang, M., & Brinton, C. G. (2024) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2024.3374591 · Cited by 9
“Unlike standard works on distributed learning [36], [37], [38], [39], we do not assume the D2D network to be strongly connected or even periodically strongly connected [38], [39] over time.”
BackgroundDistributed Stochastic Optimization with Gradient Tracking over Time- Varying Directed Networks
Nguyen, D. T. A., Nguyen, D. T., & Nedić, A. (2023) · Asilomar Conference on Signals, Systems and Computers (ACSSC) · doi:10.1109/ieeeconf59524.2023.10477004 · Cited by 13
“More recently, gradient tracking has emerged as a promising approach for distributed optimization [19]–[21].”
BackgroundSelf-citationSebastián, E., Franceschelli, M., Gasparri, A., Montijano, E., & Sagüés, C. (2024) · IEEE Control Systems Letters · doi:10.1109/lcsys.2024.3400699 · Cited by 11
“We compare our algorithm ( A2DMM-GT ) with the one in [26] ( ADMM-GT ), the accelerated gradient tracking approaches in [14] ( AGT ) and [19] ( A2GT ), and the older distributed gradient tracking protocol in [13] ( DIGing ).”
MethodDistributed Economic Dispatch Algorithms of Microgrids Integrating Grid-Connected and Isolated Modes
Liu, Z., Zhang, Y., Zhang, Y., & Wang, F. (2025) · IEEE/CAA Journal of Automatica Sinica · doi:10.1109/jas.2024.124695 · Cited by 12
Decentralized Learning With Lazy and Approximate Dual Gradients
Liu, Y., Sun, Y., & Yin, W. (2021) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2021.3056915 · Cited by 12
“Several popular methods fall into this category, including distributed ADMM (D-ADMM) [6], [7], EXTRA [2], exact diffusion [8]], DIGing [9], COLA [10], and their extensions.”
MethodDistributed Kalman filter with fuzzy noises over multiagent systems under switching topology
Zhang, X., Lin, H., Liu, G., et al. (2021) · Digital Signal Processing · doi:10.1016/j.dsp.2021.103326 · Cited by 8
Distributed ergodic algorithms for mixed equilibrium problems: Absent of cut property
Lu, K., Zhu, Q., & Yan, X. (2022) · Automatica · doi:10.1016/j.automatica.2022.110297 · Cited by 8
Distributed Resource Allocation via ADMM over Digraphs
Jiang, W., Doostmohammadian, M., & Charalambous, T. (2022) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc51059.2022.9993326 · Cited by 18
“Inspired by the dynamic average consensus [10] technique for gradient tracking in [11]–[15], authors in [3] proposed the tracking-ADMM algorithm by updating both the Lagrangian dual variable and the average of equality constraint in a distributed manner.”
MethodNoise Resilient Distributed Average Consensus Over Directed Graphs
Khatana, V., & Salapaka, M. V. (2023) · IEEE Transactions on Signal and Information Processing over Networks · doi:10.1109/tsipn.2023.3324583 · Cited by 13
“The PushSum algorithm is extensively utilized in the distributed optimization literature for distributed decision-making over general directed graphs with noiseless communication (refer to [21], [22], [23], [24], [25], [26] and references therein).”
MethodLi, H., Liu, S., Soh, Y. C., Xie, L., & Xia, D. (2017) · Chinese Control and Decision Conference (CCDC) · doi:10.1109/ccdc.2017.7978291 · Cited by 13
“[14, 15] showed that the linear convergence rates can be achieved under the assumption that the global objective function is strongly convex and has Lipschitz continuous gradient.”
BackgroundMethodInfluentialDistributed optimization for multi-agent system over unbalanced graphs with linear convergence rate
Cheng, S., & Liang, S. (2020) · Kybernetika · doi:10.14736/kyb-2020-3-0559 · Cited by 9
“[21]) For a given sequence h1,h2, · · · ,hJ , satisfies following closed circle ‖h(j\J)+1‖λ ≤ εj‖hj‖λ + θj , (6)”
BackgroundMethodInfluentialBilevel Distributed Optimization in Directed Networks
Yousefian, F. (2021) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.23919/acc50511.2021.9483429 · Cited by 22
“Among many other works such as [17], [13], is the DIGing algorithm [23] which was the first work achieving a linear convergence rate for unconstrained optimization over a time-varying network.”
BackgroundMethodMaros, M., & Jaldén, J. (2019) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp.2019.8683797 · Cited by 8
“…the optimization problem where 1 n ∈ R n denotes the vector of all ones and f ∗ ( y ) min x ∈ denotes the Fenchel conjugate of f by applying approximated projected gradient descent on (6), where the projection is approximated via a gradient tracking scheme much like the schemes in [1] and [4].”
BackgroundMethodResultInfluentialDoan, T. T., Maguluri, S. T., & Romberg, J. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1810.11568 · Cited by 12
Asynchronous Decentralized Successive Convex ApproximationPreprint
Tian, Y., Sun, Y., & Scutari, G. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1909.10144 · Cited by 10
“To prove contraction of some form of optimization errors, existing techniques developed in the literature of distributed algorithms [1, 25, 31, 38, 39] (including our companion paper [40]) leverage strong convexity of F , a property that is replaced here by the weaker local growing condition (2) in the LT error bound.”
BackgroundVariance-Reduced Decentralized Stochastic Optimization with Gradient Tracking--Part I: GT-SAGAPreprint
Xin, R., Khan, U. A., & Kar, S. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1909.11774 · Cited by 14
“Their proofs can be found in, for example, [1]–[3], [17], [18].”
BackgroundAsynchronous Policy Evaluation in Distributed Reinforcement Learning over Networks.Preprint
Sha, X., Zhang, J., Zhang, K., You, K., & Başar, T. (2020) · arXiv (Cornell University) · Cited by 8
Advances in Asynchronous Parallel and Distributed OptimizationPreprint
Assran, M., Aytekin, A., Feyzmahdavian, H. R., et al. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2006.13838 · Cited by 8
“Gradient-tracking methods using a constant step-size, such as ASY-SONATA, have this interdependence, and typically show consensus and optimality simultaneously using (18) and the small-gain theorem [88].”
MethodDecentralized Convex Optimization over Time-Varying Graphs
Rogozin, A., Gasnikov, A. V., Beznosikov, A., & Kovalev, D. A. (2023) · Springer eBooks · doi:10.1007/978-3-030-54621-2_860-1 · Cited by 7
“A possible way to build mixing matrices satisfying Assump-tion 1 is to use Metropolis weights [43]:”
BackgroundMethodInfluentialZhao, S., Song, S., & Liu, Y. (2025) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2025.3527737 · Cited by 7
“Gaussian process with zero mean and unit variance, x̃ is evenly located in [1, 10] for ∀i ∈ V .”
Compressed gradient tracking algorithms for distributed nonconvex optimization
Xu, L., Yi, X., Wen, G., Shi, Y., Johansson, K. H., & Yang, T. (2025) · Automatica · doi:10.1016/j.automatica.2025.112286 · Cited by 15
“In contrast, the DGT algorithm is able to tolerate stochastic noise [12], [37], rendering it suitable for solving nonconvex optimization problems, especially in machine learning, see, e.g., [38], [39].”
BackgroundMethodInfluentialMobility-Aware Decentralized Federated Learning for Autonomous Underwater Vehicles
He, H., Du, J., Jiang, C., Wang, J., Song, J., & Han, Z. (2025) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2025.3557803 · Cited by 7
“Directed graph with full gradient was studied in [31] using the Gradient Tracking method and proved to have a linear convergence rate.”
Accelerated Dual Averaging Methods for Decentralized Constrained Optimization
Liu, C., Shi, Y., Li, H., & Du, W. (2022) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2022.3173062 · Cited by 9
“We believe that the consensus-based dual averaging framework can be extended to tackle decentralized constrained optimization in complex networks, e.g., directed networks [43] and time-varying net-8 works [38].”
Distributed (ATC) Gradient Descent for High Dimension Sparse Regression
Yao, J., Scutari, G., Sun, Y., & Honnappa, H. (2023) · IEEE Transactions on Information Theory · doi:10.1109/tit.2023.3267742 · Cited by 11
“…optimization is plenty of schemes but DGD; they differ from plain DGD for implementing some form of correction of the local gradient direction, via distributed tracking mechanisms of the full gradient [25], [28], [31], [39], [40], [48] or using dual variables [16], [17], [18], [35], [36], [37].”
MethodNon-smooth setting of stochastic decentralized convex optimization problem over time-varying Graphs
Lobanov, A., Veprikov, A., Konin, G., Beznosikov, A. N., Gasnikov, A. V., & Kovalev, D. A. (2023) · Computational Management Science · doi:10.1007/s10287-023-00479-7 · Cited by 10
“For example, in [50] the authors proposed the DIGing algorithm, which achieves communication complexity O n 1 / 2 χ 2 κ 3 / 2 log 1 ε .”
BackgroundDistributed Consensus Optimization via ADMM-Tracking Gradient
Carnevale, G., Bastianello, N., Ruggero Carli, A., & Notarstefano, G. (2023) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc49753.2023.10383363 · Cited by 7
Primal-Dual Algorithm for Distributed Optimization with Coupled Constraints
Gong, K., & Zhang, L. (2024) · Journal of Optimization Theory and Applications · doi:10.1007/s10957-024-02393-7 · Cited by 12
“To name a few, Aug-DGM [49], DIGing [26], Push–Pull Gradient [35], Harnessing Smoothness [36], and TV-AB [39], etc. Ideas behind these methods are generalized to design algorithms for solving distributed constrained optimization problems arising in practical applications.”
The END: Estimation Network Design for Games Under Partial-Decision Information
Bianchi, M., & Grammatico, S. (2024) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2024.3393668 · Cited by 7
“With some abuse of notation, we emphasize this fact by writing In this setup, the usual approach to solve distributed optimization [19] and NE problems [4] is to assign to each agent i ∈ I an estimate ˜ y i := col (( y i,p ) p ∈P ) ∈ R n y of the whole decision variable and to let the agents…”
Zeroth-Order Decentralized Dual Averaging for Online Optimization With Privacy Consideration
Zhang, K., Lü, Q., Liao, X., & Li, H. (2024) · IEEE Transactions on Emerging Topics in Computational Intelligence · doi:10.1109/tetci.2024.3393362 · Cited by 7
“I N RECENT years, advancements in communication and sensing technologies in networked control systems have led to the emergence of various optimization tasks [1], [2].”
Distributed optimization on random graphs
Rezaeinia, P., Gharesifard, B., Linder, T., & Touri, B. (2018) · IFAC-PapersOnLine · doi:10.1016/j.ifacol.2018.12.067 · Cited by 7
A Decentralized Primal-Dual Method for Constrained Minimization of a Strongly Convex Function
Hamedani, E. Y., & Aybat, N. S. (2021) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2021.3130082 · Cited by 11
“Time-varying directed network: We generate directed timevarying communication networks similar to [21].”
BackgroundA decentralized adaptive momentum method for solving a class of min-max optimization problems
Barazandeh, B., Huang, T., & Michailidis, G. C. (2021) · Signal Processing · doi:10.1016/j.sigpro.2021.108245 · Cited by 15
“Further, these methods were originally operating in a centralized fashion; however, recent developments [16, 17, 18, 19, 20] have adapted them to decentralized problems.”
MethodDistributed Bayesian Inference Over Sensor Networks
Ye, B., Qin, J., Fu, W., Zhu, Y., Wang, Y., & Kang, Y. (2021) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2021.3106660 · Cited by 7
“Thetransition probability matrix, denoted as P = [ p ij ] ∈ R J × J with p ij ≥ 0 representing the probability of a token transmitted from node i to node j , is established using the Metropolis rule [32] to ensure that the stationary distribution is ν = [1 / J , . . . , 1 / J ] T .”
MethodHuang, Y., Meng, Z., Sun, J. Q., & Wang, G. (2023) · IEEE Transactions on Network Science and Engineering · doi:10.1109/tnse.2023.3311779 · Cited by 8
“Indeed, (11) is a marriage of the projection operator, the push-sum technique [30], [31], as well as the celebrated gradient tracking method [32], [33], [34].”
BackgroundMethodAn evolutionary game perspective on quantised consensus in opinion dynamics
Smyrnakis, M., Bauso, D., & Tembiné, H. (2019) · PLoS ONE · doi:10.1371/journal.pone.0209212 · Cited by 7
“Consensus algorithms have been used in order to find solutions among others in wireless networks [22], distributed multi-agent optimization [23, 24], signal processing [25], numerical estimation [26, 27] and opinion dynamics [20, 28].”
Decentralized Constrained Optimization: Double Averaging and Gradient Projection
Shahriari-Mehr, F., Bosch, D. D., & Panahi, A. (2021) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc45484.2021.9683355 · Cited by 8
“It extends the tracking approach, which has been proposed for the first time in [11], [12], to constrained problems and can benefit a fixed step size and fast convergence.”
BackgroundMethodInfluentialAutomatic Performance Estimation for Decentralized Optimization
Colla, S., & Hendrickx, J. M. (2023) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2023.3251902 · Cited by 16
“Actually, [4] imposes a weaker spectral condition which only requires that the union of all the networks over B steps is connected.”
BackgroundMethodInfluentialA Distributed Optimization Algorithm over Time-Varying Graphs with Efficient Gradient Evaluations
Scoy, B. V., & Lessard, L. (2019) · IFAC-PapersOnLine · doi:10.1016/j.ifacol.2019.12.181 · Cited by 7
“…examples include distributed gradient descent by Nedić and Ozdaglar (2009), EXTRA by Shi et al. (2015), AugDGM by Xu et al. (2015), NIDS by Li et al. (2017), DIGing by Nedić et al. (2017) and Qu and Li (2018), Exact Diffusion by Yuan et al. (2019), and SVL by Sundararajan et al. (2019) among others.”
BackgroundHu, J., Ran, L., Du, Z., & Li, H. (2020) · Signal Processing · doi:10.1016/j.sigpro.2020.107894 · Cited by 11
Impact of Communication Delays on the Convergence Rate of Distributed Optimization AlgorithmsPreprint
Doan, T. T., Beck, C. L., & Srikant, R. (2017) · arXiv (Cornell University) · Cited by 8
Balancing Communication and Computation in Distributed OptimizationPreprint
Berahas, A. S., Bollapragada, R., Keskar, N. S., et al. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1709.02999 · Cited by 7
“In [29], [61], [60], [47], the authors also show their respective algorithms can achieve a linear rate of convergence.”
BackgroundXin, R., & Khan, U. A. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1808.02942 · Cited by 7
“Optimization with CS weights : We now relate AB to ADD-OPT/Push-DIGing that only require CS weights [33, 34].”
BackgroundMethodResultInfluentialNested Distributed Gradient Methods with Adaptive Quantized CommunicationPreprint
Berahas, A. S., Iakovidou, C., & Wei, E. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1903.08149 · Cited by 7
Gradient tracking and variance reduction for decentralized optimization and machine learningPreprint
Xin, R., Kar, S., & Khan, U. A. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2002.05373 · Cited by 6
“s based on the push-sum (type) algorithms [39] that enable consensus with non-DS weights with the help of eigenvector estimation. Combining push-sum respectively with DSGD [14], [15], and GT-DGD [20]–[22] leads to SGP [40], and ADD-OPT [41] that require CS weights. A similar idea is used in FROST [42] to implement dec…”
MethodYi, X., Zhang, S., Yang, T., et al. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1912.12110 · Cited by 7
“[19] Strongly convex and smooth local cost functions Uniformly jointly strongly connected, two variables Discrete-time”
BackgroundA Hybrid Variance-Reduced Method for Decentralized Stochastic Non-Convex OptimizationPreprint
Xin, R., Khan, U. A., & Kar, S. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2102.06752 · Cited by 38
“, 2020; Li & Lin, 2020), gradient tracking (Di Lorenzo & Scutari, 2016; Xu et al., 2015; Pu & Nedich, 2020; Xin et al., 2020f; Nedich et al., 2017; Qu & Li, 2017; Xi et al., 2017), and primal-dual principles (Jakovetić, 2018; Li et al.”
RelaySum for Decentralized Deep Learning on Heterogeneous DataPreprint
Vogels, T., He, L., Koloskova, A., Lin, T., Karimireddy, S. P., Stich, S. U., & Jaggi, M. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2110.04175 · Cited by 67
“Out of the multitude of decentralized optimization methods, first-order algorithms that interleave local gradient updates with a form of gossip averaging [29, 11] show most promise for deep learning.”
BackgroundMethodInfluentialAccelerated Distributed Stochastic Nonconvex Optimization Over Time-Varying Directed Networks
Chen, Y., Hashemi, A., & Vikalo, H. (2024) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2024.3479888 · Cited by 17
“This has motivated the search for more robust schemes that combine decentralized bias-correction techniques, gradient tracking, and primal-dual methods [9], [10], [16], [17].”
InfluentialLiu, B., Xie, F., & Chai, L. (2025) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2025.3546087 · Cited by 9
“For this reason, existing distributed optimization algorithms over directed graphs, such as Push-DIGing [15] and ADD-OPT [20], cannot protect the privacy of agents.”
InfluentialLuan, M., Wen, G., Ge, X., et al. (2025) · Automatica · doi:10.1016/j.automatica.2025.112313 · Cited by 6
An accelerated distributed gradient method with local memory
Ren, X., Li, D., Xi, Y., et al. (2022) · Automatica · doi:10.1016/j.automatica.2022.110260 · Cited by 6
Zhang, S., Wu, W., Li, Z., Chen, J., & Georgiou, T. T. (2024) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2024.3413854 · Cited by 8
“Other higher order, nonlinear algorithms need not satisfy this interpolation condition but yet can still converge; one such example is the push–sum algorithm developed in [1] and [4].”
On the Geometric Convergence of Byzantine-Resilient Distributed Optimization Algorithms
Kuwaranancharoen, K., & Sundaram, S. (2025) · SIAM Journal on Optimization · doi:10.1137/23m1573410 · Cited by 19
Fu, L., Ma, S., Kong, L., Liang, S., & Wang, X. (2018) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2018.2814779 · Cited by 6
Distributed convex optimization with coupling constraints over time-varying directed graphs†
Zhang, B., Gu, C., & Li, J. (2020) · Journal of Industrial and Management Optimization · doi:10.3934/jimo.2020061 · Cited by 9
“and proposed a push-subgradient approach with an explicit convergence rate at order of O(lnt/ √ t), they only investigatedthe unconstrained distributed optimization problems. Veryrecently,thereference[28]proposedaPush-DIGingmethodthatusescolumn stochastic matrices and fixed step-sizes, which can achieve a geometric rat…”
BackgroundConvergence of Distributed Gradient-Tracking-Based Optimization Algorithms with Random Graphs
Wang, J., Fu, K., Gu, Y., & Li, T. (2021) · Journal of Systems Science and Complexity · doi:10.1007/s11424-021-9355-5 · Cited by 6
Decentralized Approximate Newton Methods for Convex Optimization on Networked Systems
Wei, H., Qu, Z., Wu, X., Wang, H., & Lu, J. (2021) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2021.3070663 · Cited by 7
“Among the existing algorithms in Table I, the second-order methods ANN, DQN, and D-BFGS and the first-order methods DGD, EXTRA, and DIGing indeed do not require global strong convexity to make all the iterates bounded, which suggests that the convergence analyses in [6], [8], [10], [17], [19], [20] may be extended to…”
BackgroundMethodResultInfluentialA distributed optimization algorithm over Markov switching topology under adversarial attack
Du, K., Ma, Q., Kang, Y., & Wang, S. (2022) · Journal of the Franklin Institute · doi:10.1016/j.jfranklin.2022.02.019 · Cited by 6
Zhu, J., Wang, X., Zhang, M., Liu, M., & Wu, Q. (2022) · Complex & Intelligent Systems · doi:10.1007/s40747-022-00785-8 · Cited by 7
Komuro, K., Yukawa, M., & Cavalcante, R. L. G. (2022) · IEEE Transactions on Signal and Information Processing over Networks · doi:10.1109/tsipn.2022.3181729 · Cited by 8
A resilient distributed optimization strategy against false data injection attacks
Liu, L., & Yang, G. (2022) · Optimal Control Applications and Methods · doi:10.1002/oca.2949 · Cited by 6
“According to the system dynamic and the conditions (11), xi will achieve consensus but not the optimal value x∗.”
BackgroundLi, J., An, Q., & Su, H. (2023) · Applied Mathematics and Computation · doi:10.1016/j.amc.2022.127801 · Cited by 7
A Fast Finite-Time Consensus based Gradient Method for Distributed Optimization over Digraphs
Jiang, W., & Charalambous, T. (2022) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc51059.2022.9992389 · Cited by 14
“Nearly at the same time, DIGing algorithm was proposed in [10] with linear convergence rate.”
BackgroundMethodInfluentialDecentralized optimization over slowly time-varying graphs: algorithms and lower bounds
Metelev, D., Beznosikov, A. N., Rogozin, A., Gasnikov, A. V., & Proskurnikov, A. V. (2023) · Computational Management Science · doi:10.1007/s10287-023-00489-5 · Cited by 8
“…and Giannakis 2009), vehicle coordination and control (Ren and Beard 2008), formation control (Olshevsky 2010; Ren 2006; Jad-babaie et al. 2003), distributed data analysis (Rabbat and Nowak 2004; Forero et al. 2010; Nedić et al. 2017), power system control (Ram et al. 2009; Gan et al. 2012).”
A Linearly Convergent Robust Compressed Push-Pull Method for Decentralized Optimization
Liao, Y., Li, Z., & Pu, S. (2023) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc49753.2023.10384180 · Cited by 6
“These methods achieve linear convergence for minimizing strongly convex and smooth objective functions.”
BackgroundMethodDynamic Average Diffusion With Randomized Coordinate Updates
Ying, B., Yuan, K., & Sayed, A. H. (2019) · IEEE Transactions on Signal and Information Processing over Networks · doi:10.1109/tsipn.2019.2942191 · Cited by 7
“A variety of exact first-order distributed algorithms [2], [6], [8], [16], [24], [37] have also been researched in recent years.”
BackgroundMethodInfluential
Metadata
- Authors
- Nedić, A., Olshevsky, A., & Shi, W.
- Affiliations
- Boston University (US)
- Arizona State University (US)
- Venue
- SIAM Journal on Optimization
- Published
- 2017-01
- Volume
- 27
- Issue
- 4
- Pages
- 2597-2633
- ISSN
- 1052-6234 (ISSN-L)
- 1095-7189
- OpenAlex
- W2963649943
- Cited by
- 1,069
- References
- 38
- Citations by year
- 2026: 95 · 2025: 147 · 2024: 130 · 2023: 124 · 2022: 118 · 2021: 114 · 2020: 138 · 2019: 106 · 2018: 64 · 2017: 29
- FWCI
- 46.51
- Type
- journal article
- Language
- en
- Open access
- green
- arxiv.org
- Locations
- SIAM Journal on Optimization (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- arXiv (Cornell University)
- Funders
- U.S. Air Force (AF FA95501510394)
- Office of Naval Research (N00014-12-1-0998)
- National Science Foundation (CNS 15-44953)
- 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 › Computer Science › Artificial Intelligence › Stochastic Gradient Optimization Techniques
- Keywords
- distributed optimization, dynamic graphs, geometric convergence, R-linear convergence, gradient tracking, strong convexity, fixed step size, undirected graphs, directed graphs
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).
Cited sources are checked with a language model’s help (qwen3.8-omni-flash and gpt-6-sol).
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.