Obtaining analogous equality characterizations for simple explicit constraint sets (balls or boxes)
Establish equality characterizations of value-function classes, analogous to those obtained with convex, compact, semi-algebraic lower-level constraints, for simple explicit lower-level constraint sets such as Euclidean balls or boxes, or show that such equalities cannot hold.
References
We also leave open the possibility of obtaining similar results for simple lower-level constraints set $\cY$ such as balls or boxes.
                — Geometric and computational hardness of bilevel programming
                
                (2407.12372 - Bolte et al., 17 Jul 2024) in Section "Geometric hardness of polynomial bilevel optimization", Subsection "Polynomial bilevel problems with convex lower-level", Subsubsection "Extension to arbitrary convex, compact, semi-algebraic lower-level constraints"