A Proximal Gradient Algorithm for Decentralized Composite Optimization
The DOI matches its Crossref record; 36 of the 36 references it cites were found in a registry or an index.
Abstract
This paper proposes a decentralized algorithm for solving a consensus optimization problem defined in a static networked multi-agent system, where the local objective functions have the smooth+nonsmooth composite form. Examples of such problems include decentralized constrained quadratic programming and compressed sensing problems, as well as many regularization problems arising in inverse problems, signal processing, and machine learning, which have decentralized applications. This paper addresses the need for efficient decentralized algorithms that take advantages of proximal operations for the nonsmooth terms. We propose a proximal gradient exact first-order algorithm (PG-EXTRA) that utilizes the composite structure and has the best known convergence rate. It is a nontrivial extension to the recent algorithm EXTRA. At each iteration, each agent locally computes a gradient of the smooth part of its objective and a proximal map of the nonsmooth part, as well as exchanges information with its neighbors. The algorithm is “exact” in the sense that an exact consensus minimizer can be obtained with a fixed step size, whereas most previous methods must use diminishing step sizes. When the smooth part has Lipschitz gradients, PG-EXTRA has an ergodic convergence rate of O(1/k) in terms of the first-order optimality residual. When the smooth part vanishes, PG-EXTRA reduces to P-EXTRA, an algorithm without the gradients (so no “G” in the name), which has a slightly improved convergence rate at o(1/k) in a standard (non-ergodic) sense. Numerical experiments demonstrate effectiveness of PG-EXTRA and validate our convergence results.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
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?
In the citing paper
“EXTRA converges at an o (1 /k ) rate when the objective function in (1) is convex, and it has a Q-linear rate when the objective function is strongly convex.”
From Achieving Geometric Convergence for Distributed Optimization Over Time-Varying Graphs (2017) · cites this paper as [61]
Citations
Cites
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 8×
“We have hand-op-timized this parameter and the step sizes for DADMM, DSM, and P-EXTRA.”
MethodInfluentialAn Overview of Recent Progress in the Study of Distributed Multi-Agent Coordination
Cao, Y., Yu, W., Ren, W., & Chen, G. (2013) · IEEE Transactions on Industrial Informatics · doi:10.1109/tii.2012.2219061 · Cited by 2,399
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
Distributed Control of Robotic Networks: A Mathematical Approach to Motion Coordination Algorithms
Bullo, F., Cortés, J., & Martínez, S. (2009) · Princeton University Press eBooks · doi:10.1515/9781400831470 · Cited by 1,509
PROBLEMS IN DECENTRALIZED DECISION MAKING AND COMPUTATION
Τσιτσικλής, Ι. (2014) · doi:10.12681/eadd/3778 · Cited by 1,278
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 · cited 4×
“When the possibly-nondifferentiable term , we have in (2a) and (2b) and thus (4) In (3a) and (3b), we have and thus (5) The updates (4) and (5) are known as EXTRA, a recent algo-rithm for decentralized differentiable optimization [23].”
InfluentialSelf-citationOn the Linear Convergence of the ADMM in Decentralized Consensus Optimization
Shi, W., Ling, Q., Yuan, K., Wu, G., & Yin, W. (2014) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2014.2304432 · Cited by 820 · cited 1×
“The existing algorithms that solve problem (1) include the primal-dual domain methods such as the decentralized alternating direction method of multipliers (DADMM) [16], [21] and the primal domain methods including the distributed sub-gradient method (DSM) [22].”
MethodSelf-citationDistributed Stochastic Subgradient Projection Algorithms for Convex Optimization
Sundhar Ram, S., Nedić, A., & Veeravalli, V. V. (2010) · Journal of Optimization Theory and Applications · doi:10.1007/s10957-010-9737-7 · Cited by 814
Fastest Mixing Markov Chain on a Graph
Boyd, S., Diaconis, P., & Xiao, L. (2004) · SIAM Review · doi:10.1137/s0036144503423264 · Cited by 744 · cited 1×
“Typical choices of can be found in [23], [28].”
BackgroundConsensus in Ad Hoc WSNs With Noisy Links—Part I: Distributed Estimation of Deterministic Signals
Schizas, I. D., Ribeiro, A., & Giannakis, G. B. (2008) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2007.906734 · Cited by 685 · cited 14×
“9 k 0 100 200 300 400 500 R el a ti v e E rr o r 10-10 10-8 10-6 10-4 10-2 100 DSM, step size ,k = 9:5=k1=2 DADMM, penalty coe/cient c = 0:0038 P-EXTRA, step size , = 46 k 0 100 200 300 400 500 S u cc es si ve D i, er en ce 10-10 10-5 100 105 DSM, step size ,k = 9:5=k1=2 DADMM, penalty coe/cient c = 0:0038 P-EXTRA, st…”
BackgroundMethodInfluential
Research works printed but not linked: 3
- davis, 2014, ?Convergence rates of relaxed Peaceman-Rachford and ADMM under regularity assumptions ?
- deng, 2013, ?Parallel multi-block ADMM with convergence ?
- 2011, Foundations of Location Analysis
Cited by
Items 301–368 of 368
Privacy-Guaranteed Distributed Optimization Algorithms for Power Network Systems
윤현준 (2018) · Seoul National University Open Repository (Seoul National University)
A Proximal Gradient Algorithm for Composite Consensus Optimization over Directed Graphs
Zeng, J., He, T., Ouyang, S., Wang, M., & Chang, X. (2017) · IEEE International Conference on Cyber Technology in Automation, Control, and Intelligent Systems · doi:10.1109/cyber.2017.8446454
Kajiyama, Y., Hayashi, N., & Takai, S. (2019) · IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences · doi:10.1587/transfun.e102.a.343
Towards Provable and Scalable Machine Learning
Lü, J. (2019) · OpenCommons at University of Connecticut (University of Connecticut)
Exact Diffusion Learning over Networks
Yuan, K. (2019) · eScholarship (California Digital Library)
Operator Sliding and Decentralized Optimization
Lan, G. (2020) · Springer series in the data sciences · doi:10.1007/978-3-030-39568-1_8
Stochastic SPG with Minibatches: Application to Large Scale Learning Models
Pătraşcu, A., Păduraru, C., & Irofti, P. (2020) · Studies in computational intelligence · doi:10.1007/978-3-030-52067-0_1
A distributed methodology for approximate uniform global minimum sharing
Bin, M., & Parisini, T. (2021) · Automatica · doi:10.1016/j.automatica.2021.109777
“If the functions ψi in (2) are convex, indeed, different approaches can be used, such as consensus-based (sub)gradient methods [11–16], second-order methods [17, 18], projected [19] and primaldual [20, 21] methods with inequality constraints, methods based on the distributed Alternate Direction Method of Multipliers (…”
MethodFast ADMM algorithm with efficient communication for distributed optimization of multi-agent systems
Cao, S., Jiang, X., Chi, M., & Zhang, X. (2021) · China Automation Congress (CAC) · doi:10.1109/cac53003.2021.9728441
“In recent years, the research on the the convergence of the algorithm and the convergence rate of the algorithm has become saturated, such as [5] [9].”
BackgroundSampling-based Distributed Hybrid Optimization for Multi-agent Systems
Tan, X., & Cao, J. (2022) · Asian Control Conference (ASCC) · doi:10.23919/ascc56756.2022.9828085
StochaLM: a Stochastic alternate Linearization Method for distributed optimizationPreprint
Almeida, I., & Xavier, J. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2004.11432
“Other methods which don’t use a token include, but are certainly not limited to, EXTRA [32], DIGing [33], ADD-OPT [34], Nesterov methods [35, 36], augmented Lagrangean methods [37, 38, 39], variance reduction and average gradient methods [40, 41], and others [42, 43, 44, 45, 46].”
MethodExtended ADMM with Paillier Cryptosystem for Nonsmooth Decentralized Optimization
Wang, L., Shi, X., Guo, L., Yu, L., & Zhang, Y. (2022) · Lecture notes in electrical engineering · doi:10.1007/978-981-19-3998-3_28
Typical Distributed Optimization Algorithms
Liu, F., Wang, Z., Zhao, C., & Yang, P. (2022) · Wiley eBooks · doi:10.1002/9781119827962.app1
Distributed Composite Optimization for Multi-agent Systems with Asynchrony
Li, H., Hu, J., Ran, L., Wang, Z., Lü, Q., Du, Z., & Huang, T. (2022) · Studies in systems, decision and control · doi:10.1007/978-3-030-99776-2_7
ALGORITMOS DISTRIBUÍDOS DE APRENDIZADO
COELHO, G. A. C. (2022) · doi:10.17771/pucrio.acad.61581
Lu, S., Wei, Y., Ding, Y., Cui, J., & Fang, H. (2022) · Chinese Control Conference (CCC) · doi:10.23919/ccc55666.2022.9902329
“For solving the distributed consensus optimization problem in which the local objective function has a smooth and non-smooth composite form, a distributed discrete algo-rithm based on the proximal gradient method was proposed in [8].”
MethodProjection Algorithms for Distributed Stochastic Optimization
Lü, Q., Liao, X., Li, H., Deng, S., & Gao, S. (2022) · Wireless networks · doi:10.1007/978-981-19-8559-1_2
Proximal Algorithms for Distributed Coupled Optimization
Lü, Q., Liao, X., Li, H., Deng, S., & Gao, S. (2022) · Wireless networks · doi:10.1007/978-981-19-8559-1_3
An L1 image decomposition method based on framelet analysis prior with anisotropic total variation
(2022) · Journal of Nonlinear Functional Analysis · doi:10.23952/jnfa.2022.30
Gao, W., Xie, Y., & Ren, H. (2023) · Optimal Control Applications and Methods · doi:10.1002/oca.3000
Wang, J. (2023) · DR-NTU (Nanyang Technological University) · doi:10.32657/10356/165973
First-Order Algorithms for Nonlinear Structured Optimization
Zhang, M. (2023) · Louisiana State University · doi:10.31390/gradschool_dissertations.6098
Differentially Private Regularized Stochastic Convex Optimization with Heavy-Tailed Data
Xie, H., Pietrosanu, M., Liu, Y., Tu, W. Y., Jiang, B., & Kong, L. (2023) · Statistica Sinica · doi:10.5705/ss.202022.0282
Distributed Dual Averaging for Composite OptimizationPreprint
Wu, P., Lu, H., Liu, Z., & Heyan, H. (2023) · SSRN Electronic Journal · doi:10.2139/ssrn.4663056
Distributed accelerated gradient methods with restart under quadratic growth condition
Sharma, C., Narayanan, V., & Balamurugan, P. (2024) · Journal of Global Optimization · doi:10.1007/s10898-024-01395-z
(2024) · Elsevier eBooks · doi:10.1016/b978-0-44-321636-7.00022-2
Surrogate-assisted algorithms to distributed optimization
Li, Z., & Ding, Z. (2024) · Elsevier eBooks · doi:10.1016/b978-0-44-321636-7.00019-2
Li, Z., & Ding, Z. (2024) · Elsevier eBooks · doi:10.1016/b978-0-44-321636-7.00014-3
Coordinate-update algorithms can efficiently detect infeasible optimization problems
Paeng, J., Park, J., & Ryu, E. K. (2024) · Journal of Mathematical Analysis and Applications · doi:10.1016/j.jmaa.2024.128925
“We also extend our analyses to the setup with non-orthogonal basis, thereby making our results applicable to the decentralized optimization algorithm (PG-EXTRA).”
MethodStabilization and Performance Improvement of Control Systems under State Feedback
Yao, L. (2022) · University of North Texas Digital Library (University of North Texas) · doi:10.12794/metadc1944321
Distributed Nonsmooth Constrained Optimization Algorithm under Weight-unbalanced Directed Graph
Feng, L., Guo, Z., Zeng, L., & Gao, R. (2025) · International Symposium on Autonomous Systems (ISAS) · doi:10.1109/icaisisas64483.2025.11051448
Ran, L., Li, H., Li, J. Q., Zheng, L., Tang, R., & Xia, D. (2025) · Signal Processing · doi:10.1016/j.sigpro.2025.110275
Distributed Prediction‐Correction Algorithm for Convex Optimization With Coupled Constraints
Xu, X., Yuan, Q., Li, J. Q., Xia, D., & Li, H. (2025) · Optimal Control Applications and Methods · doi:10.1002/oca.70008
“According to literature [32], we adopt the following approach to analyze the convergence rate.”
Feng, Z., Sun, D., Yuan, Y., & Zhang, G. (2025) · arXiv (Cornell University) · doi:10.48550/arxiv.2511.10069
Distributed Algorithm for Constrained Optimization with Asynchrony and Delays
Li, H., Lü, Q., Xia, D., Wang, X., Wang, Z., Zheng, L., Li, J. Q., & Ran, L. (2025) · Computational intelligence methods and applications · doi:10.1007/978-981-95-0911-9_7
Distributed Triple Proximal Splitting Algorithm for Nonsmooth Composite Optimization
Li, H., Lü, Q., Xia, D., Wang, X., Wang, Z., Zheng, L., Li, J. Q., & Ran, L. (2025) · Computational intelligence methods and applications · doi:10.1007/978-981-95-0911-9_4
Distributed Proximal Splitting Algorithm for Composite Constrained Convex Optimization
Li, H., Lü, Q., Xia, D., Wang, X., Wang, Z., Zheng, L., Li, J. Q., & Ran, L. (2025) · Computational intelligence methods and applications · doi:10.1007/978-981-95-0911-9_10
Distributed Dual Proximal Gradient Algorithms for Nonsmooth Constrained Composite Optimization
Li, H., Lü, Q., Xia, D., Wang, X., Wang, Z., Zheng, L., Li, J. Q., & Ran, L. (2025) · Computational intelligence methods and applications · doi:10.1007/978-981-95-0911-9_9
Distributed Primal-Dual Forward-Backward Splitting Algorithm for Nonsmooth Composite Optimization
Li, H., Lü, Q., Xia, D., Wang, X., Wang, Z., Zheng, L., Li, J. Q., & Ran, L. (2025) · Computational intelligence methods and applications · doi:10.1007/978-981-95-0911-9_6
Distributed Primal-Dual Fixed Point Algorithm for Multi-Block Separable Optimization
Li, H., Lü, Q., Xia, D., Wang, X., Wang, Z., Zheng, L., Li, J. Q., & Ran, L. (2025) · Computational intelligence methods and applications · doi:10.1007/978-981-95-0911-9_3
DISTRIBUTED SOLUTIONS TO COUPLED CONVEX FEASIBILITY AND OPTIMIZATION PROBLEMS ON AGENT NETWORKS
Xiao, Y. (2019) · Purdue e-Pubs (Purdue University System) · doi:10.25394/pgs.11301254
Distributed Optimization in Networked Systems
Ebrahimi, Z. (2025) · UNSWorks (University of New South Wales, Sydney, Australia) · doi:10.26190/unsworks/31437
New and Provable Results for Network Inference Problems and Multi-agent Optimization Algorithms
(2017) · Arizona State University Library Digital Repository (Arizona State University)
Gedistribueerde proximale algoritmen voor grootschalige gestructureerde optimalisatie
Latafat, P. (2020) · Lirias
Towards Computational and Sample Efficiency in Stochastic Optimization
Xiao, T. (2023) · eScholarship (California Digital Library)
Distributed Stochastic Proximal Algorithm on Riemannian Submanifolds for Weakly-convex FunctionsPreprint
Zhao, J., Wang, X., Lei, J., & Chen, S. (2025) · arXiv (Cornell University) · doi:10.48550/arxiv.2510.22270
“Since problem (1) is a distributed stochastic optimization on Riemannian submanifolds without convexity and linearity, the centralized Riemannian stochastic algorithms and the previous methods developed in the Euclidean space (such as [46]) cannot be directly applied to solve it.”
Communication-Efficient Decentralized Optimization via Double-Communication Symmetric ADMM
Huang, J., Wang, X., Liu, D., Lan, J., & Wu, R. (2025) · International Conference on Learning Representations · doi:10.48550/arxiv.2511.05283
“Several of these algorithms, including [28, 21, 30] are designed for decentralized composite optimization problems with smooth-nonsmooth structure by embedding proximal gradient steps.”
InfluentialEfficient Decoding from Heterogeneous 1-Bit Compressive Measurements over Networks
Chen, C., Zhu, Z., & Zhu, L. (2025) · Statistica Sinica · doi:10.5705/ss.202024.0329
A Unified Dual-Consensus Approach to Distributed Optimization With Globally Coupled Constraints
Liu, Z., Wu, X., Wang, D., & Lu, J. (2025) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2025.3649114
“Nevertheless, a large volume of methods for consensus optimization that dualize the consensus constraint are inapplicable [26], [28], [29], [30], as they typically need to evaluate a proximal map of the nonsmooth componentoftheobjectivefunctionateachiteration.”
InfluentialTang, R., Li, H., Xia, D., Ran, L., Li, J., & Zhu, W. (2026) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2026.102282
Decentralized Primal--Dual Optimization Without Global Lipschitz Continuity
Wang, L., Yang, S., & Zhang, M.-L. (2026) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2026.3656728
“Considering that null( I − W ) = span(1), we know that the constraint ( Referring to [24], it holds that I − W is a symmetric semi-positive definite matrix, which implies ( I − W ) x = 0 ⇔ √ I − Wx = 0.”
InfluentialA distributed semismooth Newton based augmented Lagrangian method for distributed optimizationPreprint
Ma, Q., Wang, C., Tang, P., Niu, D., & Xu, A. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2602.23854
“For the case of g i ( w ) ̸ = 0 for some i , numerous distributed algorithms have emerged over time, including PG-EXTRA [18], PG-ADMM and its stochastic variant SPG-ADMM [19], the modified version of ADMM [20], the ABC algorithm (a general unified algorithmic framework) [21], the fast distributed…”
Loopless Proximal Riemannian Gradient EXTRA for Distributed Optimization on Compact ManifoldsPreprint
Xiong, Y., Ouyang, C., You, K., Shi, Y., & Wu, L. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2603.08367
“Specifically, the Lipschitz-smooth condition in Assumption 2.2 are widely adopted in smooth manifold optimization [25–27], while Assump-tion 2.3 on the convex regularizer is typical for composite optimization settings, even in Euclidean spaces [31].”
InfluentialBundle EXTRA for Decentralized OptimizationPreprint
Liu, H., Zheng, Z., Li, C., Xu, W., & Wu, X. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2603.28220
“To achieve faster convergence, a list of advanced methods [8], [9], [10], [11], [12], [13] are proposed, such as EXTRA [8], DIGing [11], and several primal-dual methods [14], [15], [16], [17], where EXTRA and DIGing are also shown to have a primal-dual interpretation [18].”
Distributed Optimization with Coupled Constraints over Time-Varying DigraphPreprint
Kim, Y.-U., & Ahn, H. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2604.10422
“The author in [34] proposes a distributed algorithm over undirected graph based on P-EXTRA [12] which has O (1 /k ) rate.”
Li, Z., Ran, L., Li, J., & Zheng, L. (2026) · Mathematical and Computational Applications · doi:10.3390/mca31030091
“The work in [24] proposes a proximal gradient exact first-order algorithm (PG-EXTRA), marking a significant nontrivial extension to the original EXTRA.”
Distributed Fast Fixed-Point Algorithms for Composite Monotone Inclusions over NetworksPreprint
Nguyen, T. N., Necoara, I., & Dinh, Q. T. (2026) · arXiv (Cornell University) · doi:10.13140/rg.2.2.28955.84005
Similarity-Promoting Resilient Adaptive Aggregation in Peer-to-Peer Machine Learning
Bhowmick, C., & Koutsoukos, X. (2026) · Machine Learning · doi:10.1007/s10994-026-07162-3
“Others such as EXTRA (Shi et al., 2015a) and proximal-gradient methods (Shi et al., 2015b) converge under constant step sizes determined by the Lipschitz constant and the network topology.”
Linear convergence rate analysis of Proximal-Tracking for nonsmooth distributed optimizationPreprint
Yuan, T., & Xiao, X. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2609.27400
“Therefore, from Lemma 2, it follows that 𝑧 ∗ is an optimal solution to Problem (1).”
Communication efficient large scale distributed optimization with curvature acceleration
Li, Y. (2022) · Illinois Digital Environment for Access to Learning and Scholarship (University of Illinois at Urbana-Champaign)
Composite and Stochastic Smoothed Decentralized Bregman Proximal-Gradient MethodsPreprint
Xu, S., Jin, C., Wang, Q., & Zeng, T. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2610.18231
Atenas, F., Dao, M. N., Tam, M. K., & Torregrosa-Belén, D. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2610.23518
“Algorithms belonging to the PG-EXTRA family [28,29] represent some of the most prominent schemes in distributed optimisation.”
Comprehensive Survey of Distributed Optimization: Challenges, Strategies, and Applications
Luo, B. (2026) · Journal of Machine Learning and Information Security · doi:10.53941/jmlis.2026.100021
“In PG-EXTRA [37], the smooth part is updated through a local gradient step, while the non-smooth part is resolved through a proximal operator.”
Beyond Finite-Sum Optimization: A Primal-Dual Method for Decentralized Finite-Max OptimizationPreprint
Luo, Z., Wang, L., & Liu, X. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2610.26555
“…have witnessed the rapid development of decentralized algorithms for different objective functions and feasible sets, such as gradient descent algorithms [14, 39], gradient tracking methods [36, 13, 17, 30], primal-dual frameworks [23, 3, 7], proximal gradient approaches [24, 22, 28], and so on.”
Variance Reduction for Decentralized Stochastic Optimization with Multiple Local UpdatesPreprint
Liu, J., Bastianello, N., Xu, W., Ho, D. W. C., & Johansson, K. H. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2610.41927
“We also impose the following standard assumption (see [13], [30], [39], [40], [41], [42]) on the communication graph G = {V , E , W } .”
Ran, L., Li, H., Zheng, L., Li, J., & Tang, R. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2611.07703
A Fast Proximal-Gradient Algorithm for Decentralised OptimisationPreprint
Pu, Y., Tam, M. K., & Timms, L. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2611.13521
Metadata
- Authors
- Shi, W., Ling, Q., 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
- 2015-11
- Volume
- 63
- Issue
- 22
- Pages
- 6013-6023
- ISSN
- 1053-587X (ISSN-L)
- 1941-0476
- OpenAlex
- W1627780903
- Cited by
- 307
- References
- 36
- Citations by year
- 2026: 17 · 2025: 30 · 2024: 31 · 2023: 28 · 2022: 36 · 2021: 35 · 2020: 41 · 2019: 27 · 2018: 28 · 2017: 19 · 2016: 15
- FWCI
- 23.64
- Type
- journal article
- Language
- en
- Open access
- closed
- Locations
- IEEE Transactions on Signal Processing (publishedVersion)
- Funders
- National Natural Science Foundation of China (61004137, 61573331)
- National Science Foundation (DMS-1317602)
- 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 › Computational Theory and Mathematics › Optimization and Variational Analysis
- Keywords
- distributed optimization, consensus optimization, multi-agent systems, proximal gradient method, composite objective function, nonsmooth optimization, fixed step size, ergodic convergence rate, compressed sensing, regularization
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.