A discretization-based value function approximation plus penalty method solves bilevel programs with low-dimensional non-convex constrained lower-level problems, with convergence guarantees for the penalized reformulation.
Pappas, Hamed Hassani, and Volkan Cevher
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
A Discretization Approach for Bilevel Optimization with Low-Dimensional and Non-Convex Lower-Level
A discretization-based value function approximation plus penalty method solves bilevel programs with low-dimensional non-convex constrained lower-level problems, with convergence guarantees for the penalized reformulation.