Proximal Algorithms
Proximal Algorithms is a class of iterative optimization methods that solve complex minimization problems by sequentially applying proximity operators to handle non-smooth or constrained components of the objective function.
1.6K
Publications
108K
Citations
2.6K
Authors
973
Institutions
Publications per year
2017–2026
768
Variants
Proximal Methods
Parents
1.6K
1–5 of 1.6K
2.6K
19
h-index
18
h-index
17
h-index
Instituto Nacional de Matemática Pura e Aplicada, Brazil
18 publications · 3.3K citations
16
h-index
16
h-index
1–5 of 2.6K
973

Instituto Nacional de Matemática Pura e Aplicada
Rio de Janeiro, Brazil
26 h-index
51 publications
5.2K citations

Centre National de la Recherche Scientifique
Paris, France
23 h-index
65 publications
4.3K citations

Universidade Federal do Rio de Janeiro
Rio de Janeiro, Brazil
19 h-index
45 publications
1.6K citations
Nanjing University
Nanjing, China
19 h-index
43 publications
2.3K citations
Georgia Institute of Technology
Atlanta, United States
18 h-index
29 publications
1.7K citations
Massachusetts Institute of Technology
Cambridge, United States
17 h-index
42 publications
5.9K citations

National Sun Yat-sen University
Kaohsiung City, Taiwan
16 h-index
26 publications
894 citations
National University of Singapore
Singapore, Singapore
16 h-index
39 publications
6.5K citations
1–8 of 973
108 publications · 10.3K citations
53
h-index
71 publications · 12.6K citations
40
h-index
Repository · 160 publications · 17.2K citations
38
h-index
81 publications · 3.3K citations
29
h-index
51 publications · 2.2K citations
27
h-index
1–5