A sensitivity/adjoint-based augmented Lagrangian algorithm solves continuous optimistic bilevel problems with convex lower levels, with convergence and S-stationarity equivalence theory plus benchmark validation.
Title resolution pending
1 Pith paper cite this work, alongside 46 external citations. Polarity classification is still indexing.
1
Pith paper citing it
46
external citations · OpenAlex
fields
math.OC 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
A sensitivity-based method for bilevel optimization problems: Theoretical analysis and computational performance
A sensitivity/adjoint-based augmented Lagrangian algorithm solves continuous optimistic bilevel problems with convex lower levels, with convergence and S-stationarity equivalence theory plus benchmark validation.