Linear Convergence
Linear Convergence is a mathematical principle in the study of iterative algorithms that characterizes the rate at which a sequence of approximations approaches a solution, specifically when the error decreases by a constant factor at each iteration.
1.1K
Publications
64.7K
Citations
1.9K
Authors
713
Institutions
Publications per year
2017–2026
382
Parents
1.1K
Iterative Methods for the Solution of Equations.
David M. Young, J. F. Traub · American Mathematical Monthly · 1967 · 2.2K citations
On the Linear Convergence of the ADMM in Decentralized Consensus Optimization
Wei Shi, Qing Ling, Kun Yuan et al. · IEEE Transactions on Signal Processing · 2014 · 858 citations · Full text
1–5 of 1.1K
1.9K
11
h-index
11
h-index
10
h-index
10
h-index
10
h-index
1–5 of 1.9K
713

University of Minnesota
Minneapolis, United States
18 h-index
24 publications
2.3K citations

Chinese Academy of Sciences
Beijing, China
17 h-index
32 publications
1.5K citations
Princeton University
Princeton, United States
17 h-index
28 publications
1.7K citations
The University of Texas at Austin
Austin, United States
15 h-index
32 publications
1.8K citations
Carnegie Mellon University
Pittsburgh, United States
15 h-index
31 publications
4K citations
University of California, Los Angeles
Los Angeles, United States
15 h-index
33 publications
2.5K citations
University of California, Berkeley
Berkeley, United States
15 h-index
38 publications
3.4K citations
Stanford University
Stanford, United States
14 h-index
27 publications
3.3K citations
1–8 of 713
Repository · 154 publications · 7.5K citations
42
h-index
64 publications · 4.8K citations
36
h-index
40 publications · 2.8K citations
30
h-index
29 publications · 2.7K citations
25
h-index
30 publications · 2.1K citations
23
h-index
1–5