Optimistic Bilevel Optimization with Composite Lower-Level Problem
math.OC
Submitted: 2026-02-05
Updated: 2026-11-16
Terminology
Sources
- Set Smoothness Unlocks Clarke Hyper-stationarity in Bilevel Optimization
- Moreau Envelope Based Difference-of-weakly-Convex Reformulation and Algorithm for Bilevel Programs
- Approximation Methods for Bilevel Programming
- A Doubly Stochastically Perturbed Algorithm for Linearly Constrained Bilevel Optimization
- On Penalty Methods for Nonconvex Bilevel Optimization and First-Order Stochastic Approximation
- Moreau Envelope for Nonconvex Bi-Level Optimization: A Single-loop and Hessian-free Solution Strategy
Related papers
- An Accelerated Proximal Gradient Method for Bures-Wasserstein Space
- FOMTools: Development and AI-Assisted Code Generation for First-Order Methods
- Lions and Muons: Optimization via Stochastic Frank-Wolfe under Heavy-Tailed Noise
- Dynamic Service Recommendation with Congestion-Dependent Joining: Near-Optimal and Constant-Factor Approximation Algorithms
- Integrating Learning and Optimization for Open Transport Capacity Pooling under Disruption
- Zeroth-Order Gradient Estimators under Decision-Dependent Noise