Convex Variational Optimization
Convex Variational Optimization is a variational optimization framework distinguished by the requirement that both the objective functional and the constraint set exhibit convexity, ensuring the existence of globally optimal solutions and enabling the application of convex analysis to derive necessary and sufficient optimality conditions.
87
Publications
6K
Citations
200
Authors
119
Institutions
Publications per year
2017–2026
26
Parents
87
An algorithm for minimizing the Mumford-Shah functional
Thomas Pock, Daniel Cremers, Horst Bischof et al. · 2009 · 363 citations
1–5 of 87
200
4
h-index
3
h-index
3
h-index
3
h-index
2
h-index
1–5 of 200
119
Centre de Recherche en Mathématiques de la Décision
Paris, France
4 h-index
7 publications
448 citations
University of California, Los Angeles
Los Angeles, United States
3 h-index
6 publications
390 citations
University of Haifa
Haifa, Israel
3 h-index
3 publications
904 citations

Ton Duc Thang University
Ho Chi Minh City, Vietnam
2 h-index
2 publications
72 citations

Sorbonne Université
Paris, France
2 h-index
3 publications
256 citations

Northeastern University
Shenyang, China
2 h-index
5 publications
71 citations
Hong Kong Baptist University
Hong Kong, Hong Kong
2 h-index
3 publications
816 citations

Chongqing University
Chongqing, China
2 h-index
5 publications
195 citations
1–8 of 119
Repository · 5 publications · 125 citations
5
h-index
4 publications · 76 citations
4
h-index
4 publications · 316 citations
4
h-index
3 publications · 287 citations
3
h-index
2 publications · 40 citations
2
h-index
1–5