Nonsmooth Convex Optimization
Nonsmooth Convex Optimization is a subfield of convex optimization characterized by the minimization of convex functions that are not necessarily differentiable, where the lack of smoothness necessitates specialized algorithms such as subgradient, proximal, or bundle methods to handle non-differentiable points in the objective function.
987
Publications
60.6K
Citations
1.5K
Authors
697
Institutions
Publications per year
2017–2026
302
Parents
987
1–5 of 987
1.5K
16
h-index
13
h-index
13
h-index
13
h-index
13
h-index
1–5 of 1.5K
697

Harbin Institute of Technology
Harbin, China
20 h-index
43 publications
2.3K citations

Federation University
Ballarat, Australia
17 h-index
45 publications
2K citations

Hong Kong Polytechnic University
Hong Kong, Hong Kong
16 h-index
26 publications
1.5K citations

Instituto Nacional de Matemática Pura e Aplicada
Rio de Janeiro, Brazil
15 h-index
23 publications
1.7K citations
University of Washington
Seattle, United States
15 h-index
17 publications
3.1K citations
Technion – Israel Institute of Technology
Haifa, Israel
15 h-index
22 publications
1.3K citations

Centre National de la Recherche Scientifique
Paris, France
14 h-index
39 publications
3.2K citations

University of Minnesota
Minneapolis, United States
13 h-index
24 publications
5.4K citations
1–8 of 697
97 publications · 8.2K citations
48
h-index
85 publications · 7.7K citations
46
h-index
92 publications · 6.2K citations
34
h-index
Repository · 61 publications · 2.3K citations
22
h-index
34 publications · 1.6K citations
21
h-index
1–5