Showing math.OCShow all
2 papers · 1 filter
math.OC2025
Relaxation methods for pessimistic bilevel optimization
Imane Benchouk, Lateef Jolaoso, Khadra Nachi +1
We consider a smooth pessimistic bilevel optimization problem, where the lower-level problem is convex and satisfies the Slater constraint qualification. These assumptions ensure t…
math.OC2024
Scholtes relaxation method for pessimistic bilevel optimization
Imane Benchouk, Khadra Nachi, Alain Zemkoho
When the lower-level optimal solution set-valued mapping of a bilevel optimization problem is not single-valued, we are faced with an ill-posed problem, which gives rise to the opt…