Nonconvex Optimization
Nonconvex Optimization is a subfield of mathematical optimization that focuses on minimizing or maximizing nonlinear objective functions over feasible sets that lack convexity, thereby allowing for the existence of multiple local optima that are not necessarily global optima.
4.2K
Publications
279.5K
Citations
7.6K
Authors
1.8K
Institutions
Publications per year
2017–2026
2K
4.2K
Smooth minimization of non-smooth functions
Yu. Nesterov · Mathematical Programming · 2004 · 2.6K citations
1–5 of 4.2K
7.6K
24
h-index
23
h-index
23
h-index
21
h-index
19
h-index
1–5 of 7.6K
1.8K
Princeton University
Princeton, United States
53 h-index
168 publications
17K citations

University of Minnesota
Minneapolis, United States
41 h-index
108 publications
14.2K citations
University of California, Berkeley
Berkeley, United States
39 h-index
133 publications
12.7K citations
Carnegie Mellon University
Pittsburgh, United States
36 h-index
124 publications
9.7K citations
Massachusetts Institute of Technology
Cambridge, United States
36 h-index
132 publications
9.4K citations

Hong Kong Polytechnic University
Hong Kong, Hong Kong
35 h-index
99 publications
8.2K citations
Stanford University
Stanford, United States
35 h-index
104 publications
12.2K citations
Tsinghua University
Beijing, China
35 h-index
144 publications
11.6K citations
1–8 of 1.8K
151 publications · 16.6K citations
63
h-index
162 publications · 15.7K citations
62
h-index
Repository · 348 publications · 14.4K citations
55
h-index
102 publications · 8.7K citations
51
h-index
91 publications · 13.9K citations
48
h-index
1–5