Bilevel Optimization
Bilevel Optimization is a mathematical optimization framework consisting of two nested optimization problems, where the feasible region of the upper-level (leader’s) problem is constrained by the solution set of the lower-level (follower’s) problem.
1.3K
Publications
67.5K
Citations
2.7K
Authors
916
Institutions
Publications per year
2017–2026
576
Variants
Bilevel Programming
Parents
1.3K
Jinyuan Liu, Xin Fan, Zhanbo Huang et al. · 2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) · 2022 · 969 citations
Coupled Dictionary Training for Image Super-Resolution
Zhaowen Wang, Zhe Lin, Scott Cohen et al. · IEEE Transactions on Image Processing · 2012 · 816 citations
Defending Critical Infrastructure
Gerald G. Brown, Matthew Carlyle, Javier Salmerón et al. · INFORMS Journal on Applied Analytics · 2006 · 784 citations
1–5 of 1.3K
2.7K
23
h-index
23
h-index
18
h-index
18
h-index
18
h-index
1–5 of 2.7K
916
Tsinghua University
Beijing, China
23 h-index
72 publications
3.8K citations
TU Bergakademie Freiberg
Freiberg, Germany
23 h-index
50 publications
2.6K citations
Université de Montréal
Montreal, Canada
22 h-index
41 publications
4.5K citations
Wuhan University
Wuhan, China
20 h-index
75 publications
2.9K citations

Polytechnique Montréal
Montreal, Canada
20 h-index
35 publications
4.5K citations
University of Castilla-La Mancha
Ciudad Real, Spain
18 h-index
39 publications
4.2K citations
Aalto University
Espoo, Finland
18 h-index
40 publications
2.1K citations
University of Technology Sydney
Sydney, Australia
16 h-index
74 publications
3.2K citations
1–8 of 916
66 publications · 6.6K citations
45
h-index
33 publications · 2.1K citations
26
h-index
38 publications · 1.9K citations
25
h-index
31 publications · 1.5K citations
23
h-index
27 publications · 1.6K citations
23
h-index
1–5