Nonsmooth Optimization is a branch of mathematical optimization that deals with minimizing or maximizing functions that are not necessarily differentiable, thereby generalizing smooth optimization methods to handle objective functions and constraints exhibiting non-differentiable structures such as kinks, corners, or discontinuities in their gradients.
826
Publications
53.9K
Citations
1.2K
Authors
576
Institutions
Publications per year
2017–2026
223
Variants
Nondifferentiable Optimization
Publications
826
Smooth minimization of non-smooth functions
Yu. Nesterov · Mathematical Programming · 2004 · 2.6K citations
1–5 of 826
Authors
1.2K
- AB
17
h-index
- XC
15
h-index
- SN
11
h-index
- WB
11
h-index
- MG
11
h-index
1–5 of 1.2K
Institutions
576
Federation University
Ballarat, Australia
20 h-index
47 publications
2.3K citations
Harbin Institute of Technology
Harbin, China
18 h-index
38 publications
2K citations
Hong Kong Polytechnic University
Hong Kong, Hong Kong
16 h-index
32 publications
2K citations
Guangxi University
Nanning, China
13 h-index
38 publications
1.3K citations
Chinese University of Hong Kong
Hong Kong, Hong Kong
13 h-index
20 publications
1.6K citations
University of Isfahan
Isfahan, Iran
11 h-index
23 publications
536 citations
UNSW Sydney
Sydney, Australia
11 h-index
18 publications
976 citations
University of Łódź
Lodz, Poland
10 h-index
11 publications
196 citations
1–8 of 576
Venues
- SIAM Journal on Optimization
93 publications · 7K citations
42
h-index
- Mathematical Programming
65 publications · 10.1K citations
37
h-index
- Journal of Optimization Theory and Applications
67 publications · 2.9K citations
28
h-index
- Computational Optimization and Applications
25 publications · 1.1K citations
21
h-index
- Optimization
27 publications · 909 citations
18
h-index
1–5