Convex Variational Problems
Convex Variational Problems is a class of optimization problems in variational analysis where the objective functional is convex, ensuring that any local minimizer is also a global minimizer.
1.8K
Publications
108.7K
Citations
2.1K
Authors
977
Institutions
Publications per year
2017–2026
343
Parents
1.8K
1–5 of 1.8K
2.1K
29
h-index
29
h-index
24
h-index
21
h-index
20
h-index
1–5 of 2.1K
977

Ton Duc Thang University
Ho Chi Minh City, Vietnam
27 h-index
38 publications
1.9K citations

National Sun Yat-sen University
Kaohsiung City, Taiwan
24 h-index
56 publications
2.3K citations
Technion – Israel Institute of Technology
Haifa, Israel
21 h-index
48 publications
5.3K citations
Nanjing University
Nanjing, China
21 h-index
45 publications
4.5K citations

Shanghai Normal University
Shanghai, China
20 h-index
49 publications
2.3K citations

Centre National de la Recherche Scientifique
Paris, France
20 h-index
50 publications
3.9K citations
University of Washington
Seattle, United States
20 h-index
27 publications
2.4K citations
Wayne State University
Detroit, United States
18 h-index
30 publications
1K citations
1–8 of 977
145 publications · 8.4K citations
46
h-index
110 publications · 6K citations
39
h-index
59 publications · 6.3K citations
39
h-index
87 publications · 3.3K citations
34
h-index
52 publications · 2.5K citations
28
h-index
1–5