A regularization method for ill-posed bilevel optimization problems
Maïtine Bergounioux, Mounir Haddou
Abstract
We present a regularization method to approach a solution of the pessimistic formulation of ill -posed bilevel problems . This allows to overcome the difficulty arising from the non uniqueness of the lower level problems solutions and responses. We prove existence of approximated solutions, give convergence result using Hoffman-like assumptions. We end with objective value error estimates.
Create a lesson
Related papers
UGM: A Unified Framework and New Perspectives for Accelerated Gradient Methods in Smooth and Strongly Convex Optimization
Danqing Zhou, Shiqian Ma, Junfeng Yang
When MILP Beats QP: Piecewise-Linear Reformulations of Sequentially Coupled Bilinear Programs
Quentin Ploussard, Maris Usis, Oluwabunmi Iwakin et al.
Marine Autonomous Vehicle Fleet Scheduling to Maximise Scientific Impact
Mehdi El Krari, Jonathan Smith, Maria Fox
Asymptotic consensus and flocking under decaying persistent excitation on rooted digraphs
Chiara Cicolani, Elisa Continelli, Cristina Pignotti
Co-Optimized Generation, Transmission, and Storage Expansion: System Value and Optimal Duration of Pumped-Storage Hydropower
Rafael Benchimol Klausner, Rafael Kelman
Randomized Quasi-Gauss--Newton Methods for Solving General Nonlinear Equations
Chengchang Liu, Luo Luo