On the Linear Convergence of the ADMM in Decentralized Consensus Optimization
Open accessThe DOI matches its Crossref record; 34 of the 34 references it cites were found in a registry or an index.
Abstract
In decentralized consensus optimization, a connected network of agents collaboratively minimize the sum of their local objective functions over a common decision variable, where their information exchange is restricted between the neighbors. To this end, one can first obtain a problem reformulation and then apply the alternating direction method of multipliers (ADMM). The method applies iterative computation at the individual agents and information exchange between the neighbors. This approach has been observed to converge quickly and deemed powerful. This paper establishes its linear convergence rate for the decentralized consensus optimization problem with strongly convex local objective functions. The theoretical convergence rate is explicitly given in terms of the network topology, the properties of local objective functions, and the algorithm parameter. This result is not only a performance guarantee but also a guideline toward accelerating the ADMM convergence.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“The augmented Lagrangian based primal-dual methods have linear convergence under strong convexity and Lipschitz gradient assumptions [4,30] or under the positive-definite bounded Hessian assumption [12,13].”
From EXTRA: An Exact First-Order Algorithm for Decentralized Consensus Optimization (2015) · cites this paper as [30]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“Under the strong convexity assumption, the decentralized ADMM has been shown to have linear convergence for time-invariant undirected graphs [63].”
From Achieving Geometric Convergence for Distributed Optimization Over Time-Varying Graphs (2017) · cites this paper as [63]
Experimental — accuracy not yet measured
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Chung, F. (1996) · CBMS Regional Conference Series in Mathematics · doi:10.1090/cbms/092 · Cited by 5,524
Parallel and Distributed Computation: Numerical Methods
Bertsekas, D. P., & Tsitsiklis, J. N. (1989) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 5,293
Algebraic connectivity of graphs
Fiedler, M. (1973) · Czechoslovak Mathematical Journal · doi:10.21136/cmj.1973.101168 · Cited by 3,977
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 3×
“they do not rely on any predefined structures. Subgradient descent and dual ave raging work well for asynchronous networks but suffer from slow convergence. Indeed, for subgradient descent algorithms [15] and [16] establish the convergence rate of O(1/k), where k is the number of iterations, to a neighborhood of the op…”
BackgroundMethodInfluentialInformation consensus in multivehicle cooperative control
(2007) · IEEE Control Systems · doi:10.1109/mcs.2007.338264 · Cited by 3,156
Distributed 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
Optimal decentralized protocol for electric vehicle charging
Gan, L., Topcu, U., & Low, S. H. (2013) · IEEE Transactions on Power Systems · doi:10.1109/tpwrs.2012.2210288 · Cited by 997
Dual Averaging for Distributed Optimization: Convergence Analysis and Network Scaling
Duchi, J. C., Agarwal, A., & Wainwright, M. J. (2012) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2011.2161027 · Cited by 947
Dual Averaging for Distributed Optimization: Convergence Analysis and Network Scaling
Duchi, J. C., Agarwal, A., & Wainwright, M. J. (2010) · Cited by 884
On the $O(1/n)$ Convergence Rate of the Douglas–Rachford Alternating Direction Method
He, B., & Yuan, X. (2012) · SIAM Journal on Numerical Analysis · doi:10.1137/110836936 · Cited by 881
Cited by
EXTRA: 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-citationAchieving Geometric Convergence for Distributed Optimization Over Time-Varying Graphs
Nedić, A., Olshevsky, A., & Shi, W. (2017) · SIAM Journal on Optimization · doi:10.1137/16m1084316 · Cited by 1,069
“Under the strong convexity assumption, the decentralized ADMM has been shown to have linear convergence for time-invariant undirected graphs [63].”
BackgroundSelf-citationDecentralized federated learning: Fundamentals, state of the art, frameworks, trends, and challenges
Martínez Beltrán, E. T., Pérez, M. Q., Sánchez, P. M. S., Bernal, S. L., Bovet, G., Pérez, M. G., Pérez, G. M., & Celdrán, A. H. (2023) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2023.3315746 · Cited by 625
“Some examples are Decentralized Gradient Descent (DGD) [104], decentralized Alternating Direction Method of Multipliers (ADMM) [105], EXTRA [106], and ADMM based on Jacobi-Proximal [107].”
MethodNetwork Topology and Communication-Computation Tradeoffs in Decentralized Optimization
Nedic, A., Olshevsky, A., & Rabbat, M. G. (2018) · Proceedings of the IEEE · doi:10.1109/jproc.2018.2817461 · Cited by 534
NEXT: In-Network Nonconvex Optimization
Lorenzo, P. D., & Scutari, G. (2016) · IEEE Transactions on Signal and Information Processing over Networks · doi:10.1109/tsipn.2016.2524588 · Cited by 473
Multi-Agent Distributed Optimization via Inexact Consensus ADMM
Chang, T.-H., Hong, M., & Wang, X. (2015) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2014.2367458 · Cited by 444
Ghadimi, E., Teixeira, A., Shames, I., & Johansson, M. (2015) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2014.2354892 · Cited by 437
Blockchain Meets Cloud Computing: A Survey
Gai, K., Guo, J., Zhu, L., & Yu, S. (2020) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2020.2989392 · Cited by 381
Push–Pull Gradient Methods for Distributed Optimization in Networks
Pu, S., Shi, W., Xu, J., & Nedic, A. (2021) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2020.2972824 · Cited by 376
Self-citationLi, L., Xu, W., Chen, T., Giannakis, G. B., & Ling, Q. (2019) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v33i01.33011544 · Cited by 373
Self-citationA Proximal Gradient Algorithm for Decentralized Composite Optimization
Shi, W., Ling, Q., Wu, G., & Yin, W. (2015) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2015.2461520 · Cited by 307
Self-citationKargarian, A., Mohammadi, J., Guo, J., Chakrabarti, S., Barati, M., Hug, G., Kar, S., & Baldick, R. (2018) · IEEE Transactions on Smart Grid · doi:10.1109/tsg.2016.2614904 · Cited by 302
Distributed Optimization for Control
Nedić, A., & Liu, J. (2018) · Annual Review of Control, Robotics, and Autonomous Systems · doi:10.1146/annurev-control-060117-105131 · Cited by 302
Li, Z., Shi, W., & Yan, M. (2019) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2019.2926022 · Cited by 244
Self-citationLinear Convergence and Metric Selection for Douglas-Rachford Splitting and ADMM
Giselsson, P., & Boyd, S. (2017) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2016.2564160 · Cited by 225
Linear Convergence in Optimization Over Directed Graphs With Row-Stochastic Matrices
Xi, C., Mai, V. S., Xin, R., Abed, E. H., & Khan, U. A. (2018) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2018.2797164 · Cited by 215
Convergence of Asynchronous Distributed Gradient Methods Over Stochastic Networks
Xu, J., Zhu, S., Soh, Y. C., & Xie, L. (2018) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2017.2730481 · Cited by 214
A Novel Approach to Large-Scale Dynamically Weighted Directed Network Representation
Luo, X., Wu, H., Wang, Z., Wang, J., & Meng, D. (2022) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2021.3132503 · Cited by 211
Decentralized Collaborative Learning of Personalized Models over NetworksPreprint
Vanhaesebrouck, P., Bellet, A., & Tommasi, M. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1610.05202 · Cited by 207
Convergence Rate Analysis of Several Splitting Schemes
Davis, D., & Yin, W. (2016) · Scientific Computation · doi:10.1007/978-3-319-41589-5_4 · Cited by 206
Self-citationADMM Based Privacy-Preserving Decentralized Optimization
Zhang, C., Ahmad, M., & Wang, Y. (2019) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2018.2855169 · Cited by 206
Dual decomposition for multi-agent distributed optimization with coupling constraints
Falsone, A., Margellos, K., Garatti, S., & Prandini, M. (2017) · Automatica · doi:10.1016/j.automatica.2017.07.003 · Cited by 205
Convergence Rate of Distributed ADMM over NetworksPreprint
Makhdoumi, A., & Ozdaglar, A. (2017) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 202
Xin, R., & Khan, U. A. (2020) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2019.2942513 · Cited by 201
Exact Diffusion for Distributed Optimization and Learning—Part I: Algorithm Development
Yuan, K., Ying, B., Zhao, X., & Sayed, A. H. (2019) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2018.2875898 · Cited by 200
Self-citationDLM: Decentralized Linearized Alternating Direction Method of Multipliers
Ling, Q., Shi, W., Wu, G., & Ribeiro, A. (2015) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2015.2436358 · Cited by 196
Self-citationDP-ADMM: ADMM-Based Distributed Learning With Differential Privacy
Huang, Z., Hu, R., Guo, Y., Chan-Tin, E., & Gong, Y. (2020) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2019.2931068 · Cited by 190
Accelerated Distributed Nesterov Gradient Descent
Qu, G., & Li, N. (2020) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2019.2937496 · Cited by 187
Communication-efficient algorithms for decentralized and stochastic optimization
Lan, G., Lee, S., & Zhou, Y. (2020) · Mathematical Programming · doi:10.1007/s10107-018-1355-4 · Cited by 187
Distributed Subgradient Projection Algorithm Over Directed Graphs
Xi, C., & Khan, U. A. (2017) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2016.2615066 · Cited by 185
Decentralized Federated Learning With Unreliable Communications
Ye, H., Liang, L., & Li, G. Y. (2022) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2022.3152445 · Cited by 184
On Nonconvex Decentralized Gradient Descent
Zeng, J., & Yin, W. (2018) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2018.2818081 · Cited by 184
Self-citationNetwork Newton Distributed Optimization Methods
Mokhtari, A., Ling, Q., & Ribeiro, A. (2017) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2016.2617829 · Cited by 182
Self-citationADD-OPT: Accelerated Distributed Directed Optimization
Xi, C., Xin, R., & Khan, U. A. (2018) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2017.2737582 · Cited by 181
Consensus Multi-Agent Reinforcement Learning for Volt-VAR Control in Power Distribution Networks
Gao, Y., Wang, W., & Yu, N. (2021) · IEEE Transactions on Smart Grid · doi:10.1109/tsg.2021.3058996 · Cited by 181
A simple effective heuristic for embedded mixed-integer quadratic programming
Takapoui, R., Moehle, N., Boyd, S., & Bemporad, A. (2017) · International Journal of Control · doi:10.1080/00207179.2017.1316016 · Cited by 181
Optimal algorithms for smooth and strongly convex distributed optimization in networks
Scaman, K., Bach, F., Bubeck, S., Lee, Y. T., & Massoulié, L. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1702.08704 · Cited by 177
Tracking-ADMM for distributed constraint-coupled optimization
Falsone, A., Notarnicola, I., Notarstefano, G., & Prandini, M. (2020) · Automatica · doi:10.1016/j.automatica.2020.108962 · Cited by 177
Semi-Decentralized Federated Learning With Cooperative D2D Local Model Aggregations
Lin, F. P.-C., Hosseinalipour, S., Azam, S. S., Brinton, C. G., & Michelusi, N. (2021) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2021.3118344 · Cited by 175
DEXTRA: A Fast Algorithm for Optimization Over Directed Graphs
Xi, C., & Khan, U. A. (2017) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2017.2672698 · Cited by 172
ByRDiE: Byzantine-Resilient Distributed Coordinate Descent for Decentralized Learning
Yang, Z., & Bajwa, W. U. (2019) · IEEE Transactions on Signal and Information Processing over Networks · doi:10.1109/tsipn.2019.2928176 · Cited by 172
Optimal Algorithms for Non-Smooth Distributed Optimization in NetworksPreprint
Scaman, K., Bach, F., Bubeck, S., Lee, Y. T., & Massoulié, L. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1806.00291 · Cited by 172
An Exact Quantized Decentralized Gradient Descent Algorithm
Reisizadeh, A., Mokhtari, A., Hassani, H., & Pedarsani, R. (2019) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2019.2932876 · Cited by 167
Distributed Voltage Control in Distribution Networks: Online and Robust Implementations
Liu, H. J., Shi, W., & Zhu, H. (2018) · IEEE Transactions on Smart Grid · doi:10.1109/tsg.2017.2703642 · Cited by 163
Self-citationD$^2$: Decentralized Training over Decentralized Data
Tang, H., Lian, X., Yan, M., Zhang, C., & Liu, J. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1803.07068 · Cited by 159
A Survey on Some Recent Developments of Alternating Direction Method of Multipliers
Han, D. (2022) · Journal of the Operations Research Society of China · doi:10.1007/s40305-021-00368-3 · Cited by 158
A Proximal Dual Consensus ADMM Method for Multi-Agent Constrained Optimization
Chang, T. (2016) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2016.2544743 · Cited by 156
Sun, Y., Scutari, G., & Daneshmand, A. (2022) · SIAM Journal on Optimization · doi:10.1137/19m1259973 · Cited by 155
BRIDGE: Byzantine-Resilient Decentralized Gradient Descent
Fang, C., Yang, Z., & Bajwa, W. U. (2022) · IEEE Transactions on Signal and Information Processing over Networks · doi:10.1109/tsipn.2022.3188456 · Cited by 154
Linearized ADMM for Nonconvex Nonsmooth Optimization With Convergence Analysis
Liu, Q., Shen, X., & Gu, Y. (2019) · IEEE Access · doi:10.1109/access.2019.2914461 · Cited by 153
Geometric Convergence of Gradient Play Algorithms for Distributed Nash Equilibrium Seeking
Tatarenko, T., Shi, W., & Nedić, A. (2020) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2020.3046232 · Cited by 150
Self-citationMagnússon, S., Weeraddana, P. C., Rabbat, M., & Fischione, C. (2015) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2015.2476198 · Cited by 149
A General Framework for Decentralized Optimization With First-Order Methods
Xin, R., Pu, S., Nedić, A., & Khan, U. A. (2020) · Proceedings of the IEEE · doi:10.1109/jproc.2020.3024266 · Cited by 148
DSA: Decentralized Double Stochastic Averaging Gradient AlgorithmPreprint
Mokhtari, A., & Ribeiro, A. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1506.04216 · Cited by 148
Decentralized Consensus Optimization With Asynchrony and Delays
Wu, T., Yuan, K., Ling, Q. H., Yin, W., & Sayed, A. H. (2017) · IEEE Transactions on Signal and Information Processing over Networks · doi:10.1109/tsipn.2017.2695121 · Cited by 146
Self-citationGeometrically convergent distributed optimization with uncoordinated step-sizes
Nedic, A., Olshevsky, A., Shi, W., & Uribe, C. A. (2017) · 2017 American Control Conference (ACC) · doi:10.23919/acc.2017.7963560 · Cited by 145
Self-citationFaster Convergence Rates of Relaxed Peaceman-Rachford and ADMM Under Regularity Assumptions
Davis, D., & Yin, W. (2017) · Mathematics of Operations Research · doi:10.1287/moor.2016.0827 · Cited by 140
Self-citationCommunication-efficient distributed learning: An overview
Cao, X., Başar, T., Diggavi, S., Eldar, Y. C., Letaief, K. B., Poor, H. V., & Zhang, J. (2023) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2023.3242710 · Cited by 139
“When the loss functions are strongly convex and have Lipschitz continuous gradients, it has been shown in [3] that decentralized ADMM has linear convergence rate.”
BackgroundMethodA general system for heuristic minimization of convex functions over non-convex sets
Diamond, S., Takapoui, R., & Boyd, S. (2017) · Optimization methods & software · doi:10.1080/10556788.2017.1304548 · Cited by 138
Tailoring Gradient Methods for Differentially Private Distributed Optimization
Wang, Y., & Nedić, A. (2023) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2023.3272968 · Cited by 138
Explicit Convergence Rate of a Distributed Alternating Direction Method of Multipliers
Iutzeler, F., Bianchi, P., Ciblat, P., & Hachem, W. (2015) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2015.2448011 · Cited by 137
Decentralized Quasi-Newton Methods
Eisen, M., Mokhtari, A., & Ribeiro, A. (2017) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2017.2666776 · Cited by 136
A Decentralized Second-Order Method with Exact Linear Convergence Rate for Consensus Optimization
Mokhtari, A., Shi, W., Ling, Q. H., & Ribeiro, A. (2016) · IEEE Transactions on Signal and Information Processing over Networks · doi:10.1109/tsipn.2016.2613678 · Cited by 132
Self-citationA Case for Nonconvex Distributed Optimization in Large-Scale Power Systems
Guo, J., Hug, G., & Tonguz, O. K. (2016) · IEEE Transactions on Power Systems · doi:10.1109/tpwrs.2016.2636811 · Cited by 130
Salehisadaghiani, F., Shi, W., & Pavel, L. (2019) · Automatica · doi:10.1016/j.automatica.2019.01.012 · Cited by 129
Self-citationDistributed Aggregative Optimization Over Multi-Agent Networks
Li, X., Xie, L., & Hong, Y. (2021) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2021.3095456 · Cited by 125
COLA: Decentralized Linear LearningPreprint
He, L., Bian, Y., & Jaggi, M. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1808.04883 · Cited by 125
Distributed Optimization Using the Primal-Dual Method of Multipliers
Zhang, G., & Heusdens, R. R. (2017) · IEEE Transactions on Signal and Information Processing over Networks · doi:10.1109/tsipn.2017.2672403 · Cited by 124
Linear Convergence Rate of a Class of Distributed Augmented Lagrangian Algorithms
Jakovetic, D., Moura, J. M. F., & Xavier, J. (2015) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2014.2363299 · Cited by 123
FROST—Fast row-stochastic optimization with uncoordinated step-sizes
Xin, R., Xi, C., & Khan, U. A. (2019) · EURASIP Journal on Advances in Signal Processing · doi:10.1186/s13634-018-0596-y · Cited by 122
Distributed Optimization for Smart Cyber-Physical Networks
Notarstefano, G., Notarnicola, I., & Camisa, A. (2019) · Foundations and Trends® in Systems and Control · doi:10.1561/2600000020 · Cited by 122
Xu, H., Liu, P., Chen, X., & Shen, S. (2024) · IEEE Transactions on Robotics · doi:10.1109/tro.2024.3422003 · Cited by 120
DQM: Decentralized Quadratically Approximated Alternating Direction Method of Multipliers
Mokhtari, A., Shi, W., Ling, Q. H., & Ribeiro, A. (2016) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2016.2548989 · Cited by 119
Self-citationBastianello, N., Carli, R., Schenato, L., & Todescato, M. (2020) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2020.3011358 · Cited by 119
Convergence Rate of Distributed ADMM Over Networks
Makhdoumi, A., & Ozdaglar, A. (2017) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2017.2677879 · Cited by 119
DAdam: A Consensus-Based Distributed Adaptive Gradient Method for Online Optimization
Nazari, P., Tarzanagh, D. A., & Michailidis, G. C. (2022) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2022.3223214 · Cited by 118
Communication-Censored ADMM for Decentralized Consensus Optimization
Liu, Y., Xu, W., Wu, G., Tian, Z., & Ling, Q. H. (2019) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2019.2907258 · Cited by 109
Self-citationRecycled ADMM: Improving the Privacy and Accuracy of Distributed Algorithms
Zhang, X., Khalili, M. M., & Liu, M. (2019) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2019.2947867 · Cited by 107
Decentralized Learning for Wireless Communications and Networking
Giannakis, G. B., Ling, Q. H., Mateos, G., Schizas, I. D., & Zhu, H. (2016) · Scientific computation · doi:10.1007/978-3-319-41589-5_14 · Cited by 107
Self-citationLiang, S., Wang, L. Y., & Yin, G. (2019) · Automatica · doi:10.1016/j.automatica.2019.04.004 · Cited by 106
A Push-Pull Gradient Method for Distributed Optimization in Networks
Pu, S., Shi, W., Xu, J., & Nedić, A. (2018) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2018.8619047 · Cited by 104
Self-citationExact Diffusion for Distributed Optimization and Learning—Part II: Convergence Analysis
Yuan, K., Ying, B., Zhao, X., & Sayed, A. H. (2018) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2018.2875883 · Cited by 103
Self-citationA generic online acceleration scheme for optimization algorithms via relaxation and inertia
Iutzeler, F., & Hendrickx, J. M. (2017) · Optimization methods & software · doi:10.1080/10556788.2017.1396601 · Cited by 102
A Decentralized Market Model for a Microgrid With Carbon Emission Rights
Mu, C., Ding, T., Zhu, S., Han, O., Du, P., Li, F. F., & Siano, P. (2022) · IEEE Transactions on Smart Grid · doi:10.1109/tsg.2022.3173520 · Cited by 102
Privacy Preservation in Distributed Subgradient Optimization Algorithms
Lou, Y., Yu, L., Wang, S., & Yi, P. (2017) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2017.2728644 · Cited by 101
Fast Convergence Rates of Distributed Subgradient Methods With Adaptive Quantization
Doan, T. T., Maguluri, S. T., & Romberg, J. (2020) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2020.3014095 · Cited by 100
Optimal Convergence Rates for Convex Distributed Optimization in Networks
Scaman, K., Bach, F., Bubeck, S., Lee, Y. T., & Massoulié, L. (2019) · HAL · Cited by 100
Distributed radio interferometric calibration
Yatawatta, S. (2015) · Monthly Notices of the Royal Astronomical Society · doi:10.1093/mnras/stv596 · Cited by 98
Distributed Event-Triggered Gradient Method for Constrained Convex Minimization
Liu, C., Li, H., Shi, Y., & Xu, D. (2019) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2019.2916985 · Cited by 93
Magnússon, S., Shokri‐Ghadikolaei, H., & Li, N. (2020) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2020.3031073 · Cited by 92
Walkman: A Communication-Efficient Random-Walk Algorithm for Decentralized Optimization
Mao, X., Yuan, K., Hu, Y., Gu, Y., Sayed, A. H., & Yin, W. (2020) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2020.2983167 · Cited by 90
Self-citationAn Efficient Radio Frequency Interference Mitigation Algorithm in Real Synthetic Aperture Radar Data
Huang, Y., Chen, Z., Wen, C., Li, J., Xia, X., & Hong, W. (2022) · IEEE Transactions on Geoscience and Remote Sensing · doi:10.1109/tgrs.2022.3155068 · Cited by 90
Distributed MPC-Based Frequency Control in Networked Microgrids With Voltage Constraints
Liu, K., Liu, T., Tang, Z., & Hill, D. J. (2019) · IEEE Transactions on Smart Grid · doi:10.1109/tsg.2019.2902595 · Cited by 90
On the Influence of Bias-Correction on Distributed Stochastic Optimization
Yuan, K., Alghunaim, S. A., Ying, B., & Sayed, A. H. (2020) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2020.3008605 · Cited by 89
Self-citationDecentralized Accelerated Gradient Methods With Increasing Penalty Parameters
Li, H., Fang, C., Yin, W., & Lin, Z. (2020) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2020.3018317 · Cited by 88
Self-citationDistributed Discrete-Time Optimization in Multiagent Networks Using Only Sign of Relative State
Zhang, J., You, K., & Başar, T. (2018) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2018.2884998 · Cited by 86
Tight global linear convergence rate bounds for Douglas–Rachford splitting
Giselsson, P. (2017) · Journal of Fixed Point Theory and Applications · doi:10.1007/s11784-017-0417-1 · Cited by 85
Stochastic Proximal Gradient Consensus Over Random Networks
Hong, M., & Chang, T. (2017) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2017.2673815 · Cited by 85
On the distributed optimization over directed networks
Xi, C., Wu, Q., & Khan, U. A. (2017) · Neurocomputing · doi:10.1016/j.neucom.2017.06.038 · Cited by 84
Yi, X., Zhang, S., Yang, T., Chai, T., & Johansson, K. H. (2021) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2021.3108501 · Cited by 83
Metadata
- Authors
- Shi, W., Ling, Q., Yuan, K., Wu, G., & Yin, W.
- Affiliations
- University of Science and Technology of China (CN)
- University of California, Los Angeles (US)
- Venue
- IEEE Transactions on Signal Processing
- Published
- 2014-04
- Volume
- 62
- Issue
- 7
- Pages
- 1750-1761
- ISSN
- 1053-587X (ISSN-L)
- 1941-0476
- OpenAlex
- W2123705108
- Cited by
- 820
- References
- 34
- Citations by year
- 2026: 36 · 2025: 55 · 2024: 48 · 2023: 81 · 2022: 66 · 2021: 83 · 2020: 98 · 2019: 97 · 2018: 90 · 2017: 61 · 2016: 54 · 2015: 33 · 2014: 15
- FWCI
- 62.48
- Type
- journal article
- Language
- en
- Open access
- green
- arxiv.org
- Locations
- IEEE Transactions on Signal Processing (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- arXiv (Cornell University)
- Topics
- Physical Sciences › Engineering › Control and Systems Engineering › Distributed Control Multi-Agent Systems
- Physical Sciences › Computer Science › Signal Processing › Sparse and Compressive Sensing Techniques
- Physical Sciences › Computer Science › Artificial Intelligence › Stochastic Gradient Optimization Techniques
- Keywords
- alternating direction method of multipliers, linear convergence, network topology, distributed optimization, convergence acceleration, multi-agent systems
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
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.