Relaxation methods for pessimistic bilevel optimization

DOI10.1007/S11228-025-00787-XMaRDI QIDQ6851938zbMATH OpenFDO

Authors Imane Benchouk, Lateef Olakunle Jolaoso, K. Nachi, Alain B. Zemkoho

Publication date 26 February 2026

Published in Set-Valued and Variational Analysis (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S11228-025-00787-X

zbMATH Keywords

C-stationarityKKT reformulationM-stationaritypessimistic bilevel optimizationrelaxation method

Mathematics Subject Classification ID

Nonlinear programming (90C30) Sensitivity, stability, parametric optimization (90C31) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Optimality conditions and duality in mathematical programming (90C46)

Cites work

• A new regularization method for mathematical programs with complementarity constraints with strong convergence properties
• A New Relaxation Scheme for Mathematical Programs with Equilibrium Constraints
• A simple approach to optimality conditions in minmax programming
• Benchmarking optimization software with performance profiles.
• Convergence of a local regularization approach for mathematical programmes with complementarity or vanishing constraints
• Is bilevel programming a special case of a mathematical program with complementarity constraints?
• Is pessimistic bilevel programming a special case of a mathematical program with complementarity constraints?
• KKT reformulation and necessary conditions for optimality in nonsmooth bilevel optimization
• Necessary optimality conditions in pessimistic bilevel programming
• On the Karush-Kuhn-Tucker reformulation of the bilevel optimization problem
• Pessimistic bilevel optimization
• Scholtes relaxation method for pessimistic bilevel optimization
• Sensitivity analysis for two-level value functions with applications to bilevel programming
• Theoretical and numerical comparison of relaxation methods for mathematical programs with complementarity constraints
• Two-level value function approach to non-smooth optimistic and pessimistic bilevel programs
• Variational Analysis

This page was built for publication: Relaxation methods for pessimistic bilevel optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6851938)