AGILS is an alternating gradient algorithm for bilevel optimization that uses Moreau envelope reformulation to handle inexact lower-level solves, with convergence to stationary points proven under stated assumptions.
A fresh look at nonsmooth Levenberg–Marquardt methods with applications to bilevel optimization.Optimization, pages 1–48
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2024 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Alternating Gradient-Type Algorithm for Bilevel Optimization with Inexact Lower-Level Solutions via Moreau Envelope-based Reformulation
AGILS is an alternating gradient algorithm for bilevel optimization that uses Moreau envelope reformulation to handle inexact lower-level solves, with convergence to stationary points proven under stated assumptions.