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] 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] 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 701–800 of 1,070
On the Convergence Analysis of the Decentralized Projected Gradient Descent Method
Choi, W., & Kim, J. (2025) · SIAM Journal on Optimization · doi:10.1137/23m1562032 · Cited by 6
Ensuring System-Level Protection against Eavesdropping Adversaries in Distributed Dynamical Systems
Maity, D., & Mai, V. S. (2025) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.23919/acc63710.2025.11107914 · Cited by 2
“Such identification does not imply recommendation or endorsement of any product or service by NIST, nor does it imply that the materials or equipment identified are necessarily the best available for the purpose. of the initial states of the agents [8]–[11].”
Distributed Banach–Picard Iteration for Locally Contractive Maps
Andrade, F. L., Figueiredo, M. A. T., & Xavier, J. (2022) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2022.3152722 · Cited by 7
“A large body of work on distributed optimization has been produced in the last decade; see [13], [14], [15], [16], [17], [18], [19], [20], [21], [22], [23],[24], [25], [26], [27], and [28] for convex optimization, where the last reference considers a stochastic variant, and [29], [30], [31], as examples of distributed…”
BackgroundEfficient Variance-Reduced Learning Over Multi-Agent Networks
Yuan, K., Ying, B., & Sayed, A. H. (2018) · European Signal Processing Conference (EUSIPCO) · doi:10.23919/eusipco.2018.8553100 · Cited by 2
“Some recent works include techniques such as EXTRA [1], DIGing [2] and Exact diffusion [3, 4].”
MethodImproved Convergence Rates of P-EXTRA for Non-smooth Distributed optimization
Wu, X., & Lu, J. (2019) · International Conference on Control and Automation · doi:10.1109/icca.2019.8899909 · Cited by 3
“particular setting, where W is the Metropolis weight matrix [8] and W̃ = I+W 2 .”
BackgroundMethodSystematic Analysis of Distributed Optimization Algorithms over Jointly-Connected Networks
Scoy, B. V., & Lessard, L. (2020) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc42340.2020.9303998 · Cited by 2
“Our assumption on the gossip matrices does not require the graph to be connected at each iteration if B > 1 and is common in the consensus and distributed optimization literature; see [4, 5].”
InfluentialAn Edge-based Stochastic Proximal Gradient Algorithm for Decentralized Composite Optimization
Zhang, L., Yan, Y., Wang, Z., & Li, H. (2021) · International Journal of Control Automation and Systems · doi:10.1007/s12555-020-0483-9 · Cited by 2
Distributed Optimization Algorithms on Structurally Balanced Signed Networks
Du, W. J., Wei, Y., & Du, M. (2021) · International Conference on Control, Automation and Systems (ICCAS) · doi:10.23919/iccas52745.2021.9650060 · Cited by 2
Linearly Convergent Distributed Optimization Methods with Compressed Innovation
Zhang, J., & You, K. (2021) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc45484.2021.9683720 · Cited by 2
On Preconditioning of Decentralized Gradient-Descent When Solving a System of Linear Equations
Chakrabarti, K., Gupta, N., & Chopra, N. (2022) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2022.3165089 · Cited by 2
Push–Pull With Device Sampling
Hsieh, Y.-G., Laguel, Y., Iutzeler, F., et al. (2023) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2023.3250339 · Cited by 2
“Thistechnique enables the use of a fixed stepsize and exhibits much better rates in theory and in practice [22], [23], [24], [25]; see also the recent work in [26].”
BackgroundDistributed Gaussian Process Mapping for Robot Teams with Time-varying Communication
Di, J., Zobeidi, E., Koppel, A., & Atanasov, N. (2022) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.23919/acc53348.2022.9867415 · Cited by 5
“As established in [25], an important property of the Metropolis weight matrix is that Assumption 1 ensures Πt=τW t → 11 ⊤ n , i.”
BackgroundMethodInfluentialDistributed optimization with inexact oracle
Zhu, K., Zhang, Y., & Tang, Y. (2022) · Kybernetika · doi:10.14736/kyb-2022-4-0578 · Cited by 2
Zhou, S., Peng, H., Hong, X., et al. (2023) · International Symposium on Autonomous Systems (ISAS) · doi:10.1109/isas59543.2023.10164541 · Cited by 2
Decentralized Coordination of DERs for Dynamic Economic Emission Dispatch
Dai, J., & Wang, Z. (2023) · Applied Sciences · doi:10.3390/app132212431 · Cited by 2
Second-Order Properties of Noisy Distributed Gradient Descent
Qin, L., Cantoni, M., & Pu, Y. (2023) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc49753.2023.10383914 · Cited by 3
“Several techniques like Nesterov momentum [13], inexact proximal-gradient method [14], and gradient tracking [15], [16] are employed in (strongly) convex settings to enhance convergence rates, handle non-smooth functions, and achieve exact consensus with a constant step-size, respectively.”
MethodFast Distributed Resource Allocation of Smart Grid: A Zeroth-Order Optimization Algorithm
Luan, M., Wen, G., & Zheng, W. X. (2023) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc49753.2023.10383947 · Cited by 2
Distributed statistical estimation in quantile regression over a network
Wang, Y., Lu, W., & Lian, H. (2024) · Signal Processing · doi:10.1016/j.sigpro.2024.109512 · Cited by 2
The minimizer of the sum of two strongly convex functions
Kuwaranancharoen, K., & Sundaram, S. (2024) · Optimization · doi:10.1080/02331934.2024.2402923 · Cited by 6
“However, many algorithms proposed to address decentralized optimization problems, such as [12, 18, 19], assume the reliability of all nodes in the network – they follow the designed algorithm.”
A Flexible Distributed Optimization Framework for Service of Concurrent Tasks in Processing Networks
Shi, Z., & Eryılmaz, A. (2019) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infocom.2019.8737632 · Cited by 2
“For DIGing algorithm, it can obtain the exact solution in a linear rate using a fixed stepsize [13].”
MethodCompress sensing algorithm for estimation of signals in sensor networks
Martínez, J., Mejia, J. M., Mederos, B., Ochoa, A., Cruz‐Mejía, O., & Marmolejo-Saucedo, J. A. (2019) · Wireless Networks · doi:10.1007/s11276-019-02031-5 · Cited by 2
A gradient tracking method for resource allocation base on distributed convex optimization
Fu, E., Gao, H., Fasehullah, M., & Tan, L. (2019) · International Symposium on Autonomous Systems (ISAS) · doi:10.1109/isass.2019.8757716 · Cited by 2
Romao, L. B. R. R., Margellos, K., Notarstefano, G., & Papachristodoulou, A. (2019) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc40024.2019.9029252 · Cited by 2
“A new research direction involves the use of gradient tracking, mainly because sharp convergence results can be obtained for directed and undirected communication networks [7], [8], [9].”
BackgroundDistributed empirical risk minimization over directed graphs
Xin, R., Sahu, A. K., Kar, S., & Khan, U. A. (2019) · Asilomar Conference on Signals, Systems and Computers (ACSSC) · doi:10.1109/ieeeconf44664.2019.9049065 · Cited by 3
“First, it is straightforward to obtain the algorithm in [19], [29] from AB by replacing both the row-stochastic A and the column-stochastic B with doubly-stochastic weight matrices.”
BackgroundMethodInfluentialDistributed multi‐agent optimisation via coordination with second‐order nearest neighbours
Ren, X., Li, D., Xi, Y., et al. (2020) · IET Control Theory and Applications · doi:10.1049/iet-cta.2019.0708 · Cited by 2
A Distributed Adaptive Moment Estimation Method With Dynamic Bound For Online Optimization
Shen, X., Fang, R., Li, D., & Wu, X. (2020) · International Conference on Control and Automation · doi:10.1109/icca51439.2020.9264510 · Cited by 2
Li, W., Assaad, M., & Zheng, S. (2021) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2021.3077516 · Cited by 3
“Sub-gradient based methods have been proposed to solve distributed optimization of the sum of several convex function, over time-varying [7], [8], [9] or asynchronous [10], [11] networks.”
MethodAn Acceleration of Decentralized SGD Under General Assumptions with Low Stochastic Noise
Trimbach, E., & Rogozin, A. (2021) · Communications in computer and information science · doi:10.1007/978-3-030-86433-0_8 · Cited by 3
“Moreover, decentralized schemes such as DIGing [17] and Push-Pull Gradient Method [18] are capable of working on a time-varying network.”
MethodOn the Convergence of NEAR-DGD for Nonconvex Optimization with Second Order Guarantees
Iakovidou, C., & Wei, E. (2021) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc45484.2021.9683777 · Cited by 2
“Other approaches include primal-dual algorithms [11], [12] (we note that primal-dual and gradient tracking algorithms are equivalent in some cases [3]), the perturbed push-sum method [13], zeroth order methods [14], [15], and stochastic gradient algorithms [16]–[19].”
MethodDistributed Convex Optimization With Coupling Constraints Over Time-Varying Directed GraphsPreprint
Gu, C., Wu, Z., Li, J., & Guo, Y. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1805.07916 · Cited by 4
“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…”
BackgroundHan, S. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1810.00257 · Cited by 2
“In this paper, we study the distributed gradient tracking algorithm in [13] or equivalently the DIGing algorithm in [11], in which the update equations are given by where and η > 0 is the step size.”
MethodA Unification and Generalization of Exact Distributed First Order MethodsPreprint
Jakovetić, D. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1709.01317 · Cited by 2
“The paper [19] establishes global linear convergence for time-varying networks.”
BackgroundMethodInfluentialCompressed Distributed Gradient Descent: Communication-Efficient Consensus over NetworksPreprint
Zhang, X., Liu, J., Zhu, Z., et al. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1812.04048 · Cited by 2
“, achieving the same O(1/k) convergence rate with constant step-size [18] or even under time-varying network graphs [19]).”
BackgroundDistributed Least Squares Solver for Network Linear EquationsPreprint
Yang, T., George, J., Qin, J., et al. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1810.00156 · Cited by 2
A Unified Contraction Analysis of a Class of Distributed Algorithms for Composite OptimizationPreprint
Xu, J., Sun, Y., Tian, Y., et al. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1910.09817 · Cited by 2
“When G = 0, several distributed schemes have been proposed in the literature enjoying such a property; examples include EXTRA [1], AugDGM [2], NEXT [3], SONATA [4], [5], DIGing [6], NIDS [7], Exact Diffusion [8], MSDA [9], and the distributed algorithms in [10], [11], and [12].”
BackgroundInfluentialFlexPD: A Flexible Framework Of First-Order Primal-Dual Algorithms for Distributed OptimizationPreprint
Mansoori, F., & Wei, E. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1912.07526 · Cited by 2
“Recently, distributed gradient based methods with gradient tracking technique have been developed [47], [39], [50], [34].”
BackgroundMethodA general framework for decentralized optimization with first-order methodsPreprint
Xin, R., Pu, S., Nedić, A., et al. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2009.05837 · Cited by 2
“We note that the general idea of push-sum consensus, explored over the GT-DGD framework as in ADDDOPT/Push-DIGing [13], [40], essentially results from a state transformation in AB / Push-Pull .”
BackgroundMethodResultInfluentialSelf-citationDecentralized Riemannian Gradient Descent on the Stiefel ManifoldPreprint
Chen, S., García, A., Hong, M., & Shahrampour, S. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2102.07091 · Cited by 13
“With an auxiliary gradient tracking sequence to estimate the full gradient, the constant stepsize can be used and faster convergence rate can be shown for the Euclidean algorithms (Nedic et al., 2017; Shi et al., 2015).”
BackgroundMethodInfluentialCharacterizing Trust and Resilience in Distributed Consensus for Cyberphysical SystemsPreprint
Yemini, M., Nedić, A., Goldsmith, A. J., et al. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2103.05464 · Cited by 2
Self-citationProvably Accelerated Decentralized Gradient Method Over Unbalanced Directed GraphsPreprint
Song, Z., Shi, L., Pu, S., & Yan, M. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2107.12065 · Cited by 1
“Approaches such as EX-TRA [48], NIDS [28], and gradient tracking methods [14, 15, 35, 42, 65] achieve linear convergence rates for smooth and strongly convex functions over undirected networks with (symmetric) doubly stochastic mixing matrices.”
BackgroundMethodInfluentialPrivate Federated Learning Without a Trusted Server: Optimal Algorithms for Convex LossesPreprint
Lowy, A. M., & Razaviyayn, M. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2106.09779 · Cited by 25
“In non-private distributed optimization, [LO10, TG15, NOS17] provide convergence results with random connectivity graphs.”
BackgroundYuan, H., Alghunaim, S. A., & Yuan, K. (2023) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc49753.2023.10384058 · Cited by 1
Fully Stochastic Distributed Convex Optimization on Time-Varying Graph with Compression
Yau, C.-Y., & Wai, H.-T. (2023) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc49753.2023.10383992 · Cited by 1
“…setting, also see [6] for a recent treatment on the topic for large-scale machine learning; [7], [8] considered incorporating gradient tracking to accelerate convergence; [9] studied an extension to directed graphs, also see [10], [11] for time varying graphs and stochastic optimization, etc.”
BackgroundMethodDecentralized Conjugate Gradient Tracking for Sum-of-Nonconvex Optimization
Zhang, Z., & Ni, Y.-H. (2024) · Chinese Control Conference (CCC) · doi:10.23919/ccc63176.2024.10661557 · Cited by 1
Resilient Distributed Optimization Algorithm Based on Trusted Nodes against Malicious Attacks
Cao, L., & Gao, W. (2024) · Chinese Control Conference (CCC) · doi:10.23919/ccc63176.2024.10662289 · Cited by 1
“In benign environments, there are many mature distributed optimization algorithms available, such as gradient descent algo-rithm [6] and dual averaging algorithm [7] with decreasing stepsizes, EXTRA algorithm [8] and DIGing algorithm [9] with fixed stepsize, and so on.”
MethodDecentralized Learning of Quantile Regression: A Smoothing Approach
Shi, J., Wang, Y., Zhu, Z., & Lian, H. (2024) · Journal of Computational and Graphical Statistics · doi:10.1080/10618600.2024.2431060 · Cited by 4
“GT (Nedi´c, Olshevsky, and Shi 2017; Qu and Li 2018) was proposed exactly to address this problem, better approximating the global gradient through an additional update step.”
A Flexible Framework for Decentralized Composite Optimization with Compressed Communication
Chang, Z., Zhang, Z., Yang, S., & Cao, J. (2024) · Fractal and Fractional · doi:10.3390/fractalfract8120721 · Cited by 1
Distributed Constrained Optimization Algorithms for Drones
Liu, H. (2025) · Drones · doi:10.3390/drones9010036 · Cited by 1
“For time-varying unbalanced graphs, the Push-DIGing algorithm and a push–pull-based algorithm were proposed in [23,24].”
Distributed Event-Triggered Nonconvex Optimization under Polyak-Łojasiewicz Condition
Gao, C., Xu, L., Zhang, K., Li, Y., Liu, Z., & Yang, T. (2024) · International Conference on Control, Automation, Robotics and Vision (ICARCV) · doi:10.1109/icarcv63323.2024.10821649 · Cited by 3
Decentralized Nonstationary Fuzzy Neural Network with Meta-Learning-Net
Zhang, Z., Yu, M., & Jia, H. (2025) · Mathematics · doi:10.3390/math13040552 · Cited by 1
Gradient Tracking for Sum‐of‐Nonconvex Decentralized Optimization
Zhang, Z., & Ni, Y. (2025) · International Journal of Robust and Nonlinear Control · doi:10.1002/rnc.7978 · Cited by 1
“Because of the simplicity, efficiency and scalability, lots of GT-based decentralized optimization algorithms have been proposed to handle various practical problems, such as GT over directed networks [22] and time-varying networks [23], and compressed GT over communication limited networks [24].”
Zhang, S., Pananjady, A., & Romberg, J. (2025) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2025.3562997 · Cited by 6
“As remedies to these issues, several methods relying on tracking the differences of gradients have been proposed [14], [15], [16], [17], [18], [19].”
Asynchronous distributed algorithm for constrained optimization and its application
Wang, T., Li, Z., Nie, R., & Du, W. (2025) · Science China Technological Sciences · doi:10.1007/s11431-024-2852-1 · Cited by 3
Kuruzov, I. A., Alkousa, M. S., Stonyakin, F. S., et al. (2025) · Optimization methods & software · doi:10.1080/10556788.2025.2475404 · Cited by 1
“Such primal algorithms as the Push-Pull Gradient Method [29] and DIGing [26] are robust to network changes and have theoretical guarantees of convergence over time-varying graphs.”
InfluentialFriedkin-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
“Other distributed optimization algorithms can be used to solve the minimization problem in (2) [22], [23], [24].”
Hu, Z., & Ni, C. (2025) · ISA Transactions · doi:10.1016/j.isatra.2025.07.045 · Cited by 1
Decentralized Nonconvex Low-rank Matrix Recovery
Gao, J., & Lian, H. (2025) · IEEE Transactions on Image Processing · doi:10.1109/tip.2025.3588719 · Cited by 1
“…A = { a ij } is doubly stochastic, that is, For ease of notation, we denote where We use the distributed gradient algorithm with gradient tracking [28], [29], which, for the current problem, presents itself as for t = 0 , 1 , 2 , . . . , with some initialization Here, s ti tries to track the…”
Distributed learning and optimization of a multi-agent macroscopic probabilistic model
Brumali, R., Carnevale, G., & Notarstefano, G. (2025) · European Journal of Control · doi:10.1016/j.ejcon.2025.101332 · Cited by 1
Gradient-free algorithms based on weight-balancing for online distributed optimisation
Shang, J., Mo, L., Zuo, M., & Wang, Y. (2025) · International Journal of Systems Science · doi:10.1080/00207721.2025.2538736 · Cited by 1
Peng, Y., Zhang, S., Zhou, Z., Wen, P., & Huang, F. (2025) · Signal Processing · doi:10.1016/j.sigpro.2025.110289 · Cited by 1
Deng, K., & Hu, J. J. (2025) · Numerische Mathematik · doi:10.1007/s00211-025-01497-0 · Cited by 28
“1) by leveraging the gradient tracking techniques introduced in [35, 40, 12] to get a better estimate for the full gradient.”
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
“In their work [22], the authors decompose the Push-DIGing discrete iterative system into four error signals e 1 , e 2 , e 3 , e 4 , representing the global optimization error, gradient variation, consensus error, and gradient tracking error, respectively.”
InfluentialResilient Distributed Economic Dispatch in Smart Grids
Yuan, L., & Ishii, H. (2025) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2025.3621981 · Cited by 1
“From this point of view, there have been many efforts devoted to consensus-based distributed optimization problems with constraints [23] and even in the time-varying communication networks [24].”
Distributed implementation of DeePC for multi-input LTI systems
Sun, Z., Duan, Z., & Ren, Y. (2025) · Automatica · doi:10.1016/j.automatica.2025.112666 · Cited by 3
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
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
“[41], [42], [43] have introduced auxiliary dynamics for global gradient information, and [44] have proposed a feasible centralized gradient estimation scheme via orthogonal random directions.”
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
“The case of link failures, as modeled using time-varying networks, has been studied in [21], [22] for DGD and gradient tracking methods, yet their results are limited as these algorithms require deterministic gradients.”
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
“In prior works like [52], only the underlying physical graph is time-varying, and consensus operations are carried out whenever possible, i.e., at every iteration.”
Prediction-Based Distributed Zero-Order Optimization Algorithm Under Sparsification Transmissions
Liu, S., Wang, D., Lian, J., & Wu, F. (2025) · IEEE Internet of Things Journal · doi:10.1109/jiot.2025.3644162 · Cited by 1
“Assumption 1 is standard and widely adopted in distributed optimization scenarios [6], [7], [8], [23], [24].”
Distributed Nash equilibrium computation in multi-group resource allocation games over digraphs
Zhou, J., Wen, G., Lv, Y., et al. (2026) · Automatica · doi:10.1016/j.automatica.2025.112816 · Cited by 1
A Directed Distributed Proximal-Tracking Algorithm for Constrained Optimization
Li, Y., Chen, J., Wu, C., et al. (2025) · IEEE Control Systems Letters · doi:10.1109/lcsys.2026.3651704 · Cited by 1
“A well-established algorithm for solving problem (P) over directed networks is the ADD-OPT algorithm [20], [30].”
Robust Distributed Cooperative Classification With Learned Compressed-Feature Diffusion
Yao, X., Chen, J., & Chen, J. (2026) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2026.3652297 · Cited by 3
“Classical methods include consensus-based distributed (sub)gradient descent (DGD) [85], exact first-order algorithm (EXTRA) [68], and gradient tracking algorithms (e.g., DIGing [86]).”
Chen, Z., Yu, W., & Liu, Q. (2026) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2026.3652224 · Cited by 1
“Besides this, it is di ffi cult to solve problems with coupled constraints based on gradient tracking and prove the convergence [10], [26], [27], [28], [29].”
Coordination-free decentralised federated learning in pervasive networks: Overcoming heterogeneity
Valerio, L., Boldrini, C., Passarella, A., Kertész, J., Karsai, M., & Íñiguez, G. (2026) · Pervasive and Mobile Computing · doi:10.1016/j.pmcj.2026.102184 · Cited by 6
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
“Following this update, node i updates its intermediate state variable v ki using the rescaled subgradient ∇ f i ( ϕ ki ) /µ k + 1 i as follows: where denotes the element at i th row and j th column of Under Assumption 3, it can be concluded that B k is a row-stochastic matrix [30], [31], [42].”
Topology-Optimal Multiple Gossip Steps for Decentralized Federated Learning via Gossip Tensor
Zhong, Y., Ma, L., & Yan, X. (2026) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2026.3670013 · Cited by 1
“The most common assumption for W is that W is symmetric and doubly stochastic [11], [21], [22].”
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
“By contrast, methods such as subgradient-push (SGP) [18, 19, 2], SONATA [35, 30] and Push-DIGing/ADD-OPT [21, 36, 15] utilize column-stochastic and/or row-stochastic weight matrices, enabling consensus optimization on strongly connected directed graphs.”
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
“There have been many algorithms to solve these problem under different settings [2]–[7].”
Distributed Optimal Economic Dispatch for Smart Grids Based on Multi-Agent System
Han, Q., Xie, Y. L., Wang, H., et al. (2019) · International Conference on Safety Produce Informatization (IICSPI) · doi:10.1109/iicspi48186.2019.9095884 · Cited by 1
“So far, a number of distributed algorithm have been proposed[12 (cid:28708) 17].”
BackgroundLou, R., Wang, L., & Ma, D. (2020) · Chinese Control Conference (CCC) · doi:10.23919/ccc50068.2020.9189465 · Cited by 1
“This motivate the study of distributed optimization [8–11].”
BackgroundAn 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
“For example, the decentralized gradient descent (DGD) algorithm [5], the exact first-order algorithm (EXTRA) [6], and the DIGing algorithm [7] are efficient methods intended for un-constrained convex optimization.”
MethodConvergence 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
“The gradient tracking method was introduced in [26, 14, 21] where an auxiliary variable is introduced to track the difference of the gradients in a consensus setting.”
MethodAn Accelerated Gossip-Based Distributed Gradient Method
Ren, X., Li, D., Xi, Y., & Shao, H. (2021) · Chinese Control Conference (CCC) · doi:10.23919/ccc52363.2021.9549539 · Cited by 1
“Aside from the convergence rate issue, another focus of interest is the communication protocol among agents, for example, time-varying graph [3,5,9] and gossip-based communication protocol [6, 10, 11].”
BackgroundMethodYun-shan, L., Xiong, H., Zhou, H. Y., & Guan, X. (2022) · Mathematics · doi:10.3390/math10030357 · Cited by 2
“Based on HSADO, researchers modified to adapt different scenarios, such as time-varying networks [27,28] and node-varying [29,30] and accelerated methods [31,32].”
MethodXu, 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
Q-linear Convergence of Distributed Optimization with Barzilai-Borwein Step Sizes
Emiola, I., & Enyioha, C. (2022) · Allerton Conference on Communication, Control, and Computing · doi:10.1109/allerton49937.2022.9929424 · Cited by 3
“Literature Review This paper builds on earlier work on Distributed Gradient Descent (DGD) methods [22, 23], [17, 18] as well”
MethodResultA 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
Accelerated 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_6 · 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
“Further, to tackle data heterogeneity, more robust schemes combining decentralized bias-correction techniques, gradient tracking and primal-dual methods have been proposed [5, 6].”
An Accelerated Gradient Tracking Algorithm with Projection Error for Distributed Optimization
Meng, X., Liu, Q., & Xiong, J. (2023) · International Conference on Advanced Computational Intelligence (ICACI) · doi:10.1109/icaci58115.2023.10146136 · Cited by 1
“Consequently, to overcome this difficulty, [19] investigates the distributed optimization problem on time-varying undirected and directed graphs, and proposes the DIGing.”
BackgroundCommunication Compression for Decentralized Learning With Operator Splitting Methods
Takezawa, Y., Niwa, K., & Yamada, M. (2023) · IEEE Transactions on Signal and Information Processing over Networks · doi:10.1109/tsipn.2023.3307894 · Cited by 2
Distributed 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
“Our CompSkipDSGD exhibits resemblances to distributed algorithms employed in time-varying graph scenarios [38], [39].”
MethodLuo, K., Zhang, K., Zhang, S., Li, X., & Gao, M. (2023) · Frontiers in artificial intelligence and applications · doi:10.3233/faia230445 · Cited by 1
A Tracking Augmented Lagrangian Method for ℓ0 Sparse Consensus Optimization
Olama, A., Carnevale, G., Notarstefano, G., & Camponogara, E. (2023) · International Conference on Control, Decision and Information Technologies (CoDIT) · doi:10.1109/codit58514.2023.10284260 · Cited by 1
An Extended Gradient Method for Smooth and Strongly Convex Functions
Zhang, X., Liu, S., & Zhao, N. (2023) · Mathematics · doi:10.3390/math11234771 · Cited by 1
“Recently, the distributed gradient methods [22–24] combined with more techniques can converge linearly to the optimal solution.”
MethodFractional 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
“In [5], [6], a discrete-time distributed algorithm with diminishing step-sizes is proposed where the diminishing gain is used to guarantee it can asymptotically converge to one of the optimal solutions.”
BackgroundLinear Convergence of distributed estimation with constraints and communication delays
Zhou, Y., & Chen, G. (2023) · Journal of the Franklin Institute · doi:10.1016/j.jfranklin.2023.12.030 · Cited by 1
Decentralized Stochastic Optimization With Pairwise Constraints and Variance Reduction
Han, F., Cao, X., & Gong, Y. (2024) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2024.3374082 · Cited by 1
“In the deterministic setting, numerous recent theoretical advances have been studied extensively including decentralized gradient descent (DGD) [9], decentralized ADMM [10], exact first-order (EXTRA) [11], exact diffusion [12] and decentralized gradient-tracking (DIGing) [13].”
BackgroundDistributed optimization algorithm for multi‐agent networks with lazy gradient information
Mo, L., Yang, Y., & Huang, X. (2024) · Asian Journal of Control · doi:10.1002/asjc.3422 · Cited by 1
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.