Bilevel Stackelberg model with KKT single-level reformulation and LDD-ADMM distributed algorithm coordinates LV communities and MV network on IEEE 33-bus and 206-bus LV feeders, achieving 1.7e-4 average deviation from exact solution.
An augmented lagrangian value function method for lower-level constrained stochastic bilevel optimization
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
fields
math.OC 2years
2026 2verdicts
UNVERDICTED 2roles
background 1polarities
background 1representative citing papers
Penalty-based first-order methods find ε-KKT points in bilevel minimax problems with Õ(ε^{-4}) deterministic and Õ(ε^{-9}) stochastic oracle complexity, improving prior bounds for constrained lower-level cases via Lagrangian duality.
citing papers explorer
-
A Bilevel Optimization Model for Bottom-Up Coordination of Multiple Low-Voltage Energy Communities and the Medium-Voltage Network
Bilevel Stackelberg model with KKT single-level reformulation and LDD-ADMM distributed algorithm coordinates LV communities and MV network on IEEE 33-bus and 206-bus LV feeders, achieving 1.7e-4 average deviation from exact solution.
-
Penalty-Based First-Order Methods for Bilevel Optimization with Minimax and Constrained Lower-Level Problems
Penalty-based first-order methods find ε-KKT points in bilevel minimax problems with Õ(ε^{-4}) deterministic and Õ(ε^{-9}) stochastic oracle complexity, improving prior bounds for constrained lower-level cases via Lagrangian duality.