Coordinate Descent
Coordinate Descent is a first-order optimization algorithm that iteratively minimizes a multivariate function by sequentially updating one coordinate (or coordinate block) at a time, using only univariate optimization along each coordinate direction while holding others fixed.
1.1K
Publications
118.4K
Citations
2.5K
Authors
789
Institutions
Publications per year
2017–2026
500
Variants
Coordinate Descent Method
1.1K
1–5 of 1.1K
2.5K
20
h-index
15
h-index
14
h-index
13
h-index
13
h-index
1–5 of 2.5K
789

University of Electronic Science and Technology of China
Chengdu, China
25 h-index
98 publications
5.6K citations
Stanford University
Stanford, United States
25 h-index
66 publications
56.7K citations

University of Minnesota
Minneapolis, United States
23 h-index
56 publications
7.7K citations

Southeast University
Nanjing, China
21 h-index
75 publications
3.6K citations

University of Edinburgh
Edinburgh, United Kingdom
19 h-index
35 publications
3.8K citations
Massachusetts Institute of Technology
Cambridge, United States
19 h-index
59 publications
4.2K citations
Tsinghua University
Beijing, China
17 h-index
49 publications
2.3K citations
National University of Singapore
Singapore, Singapore
17 h-index
31 publications
3.3K citations
1–8 of 789
Repository · 111 publications · 5K citations
35
h-index
47 publications · 3.5K citations
33
h-index
27 publications · 5.4K citations
21
h-index
24 publications · 1.3K citations
20
h-index
24 publications · 1K citations
20
h-index
1–5