Scholtes relaxation method for pessimistic bilevel optimization

DOI10.1007/S11228-025-00747-5MaRDI QIDQ6999379zbMATH OpenFDO

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

Publication date 9 April 2025

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-00747-5

zbMATH Keywords

C-stationarityKKT reformulationpessimistic bilevel optimizationScholtes relaxation

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) 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 simple approach to optimality conditions in minmax programming
• A special newton-type optimization method
• Benchmarking optimization software with performance profiles.
• Bilevel optimization. Advances and next challenges
• BOLIB: bilevel Optimization LIBrary of test problems
• Complete Characterization of Openness, Metric Regularity, and Lipschitzian Properties of Multifunctions
• Convergence properties of a regularization scheme for mathematical programs with complementarity constraints
• Foundations of bilevel programming
• Gauss-Newton-type methods for bilevel optimization
• Generalized equations and their solutions, part II: Applications to nonlinear programming
• scientific article; zbMATH DE number 46303 (Why is no real title available?)
• scientific article; zbMATH DE number 4128662 (Why is no real title available?)
• 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
• Levenberg-Marquardt method and partial exact penalty parameter selection in bilevel optimization
• Necessary optimality conditions in pessimistic bilevel programming
• On the computation of relaxed pessimistic solutions to MPECs
• On the Constant Positive Linear Dependence Condition and Its Application to SQP Methods
• On the Karush-Kuhn-Tucker reformulation of the bilevel optimization problem
• On the lower semicontinuity of optimal solution sets
• Openness stability and implicit multifunction theorems: applications to variational systems
• Pessimistic bilevel optimization
• Reformulation of the M-stationarity conditions as a system of discontinuous equations and its solution by a semismooth Newton method
• Semismooth Newton-type method for bilevel optimization: global convergence and extensive numerical experiments
• Sensitivity analysis for two-level value functions with applications to bilevel programming
• Solving ill-posed bilevel programs
• The complexity of constrained min-max optimization
• The lower semicontinuity of optimal solution sets
• The standard pessimistic bilevel problem
• Theoretical and numerical comparison of relaxation methods for mathematical programs with complementarity constraints
• Theoretical and numerical comparison of the Karush-Kuhn-Tucker and value function reformulations in bilevel optimization
• Towards tractable constraint qualifications for parametric optimisation problems and applications to generalised Nash games
• Two-level value function approach to non-smooth optimistic and pessimistic bilevel programs
• Variational Analysis
• Variational Stability and Marginal Functions via Generalized Differentiation
• Weak via strong Stackelberg problem: New results

Cited in

(1)

• Relaxation methods for pessimistic bilevel optimization

This page was built for publication: Scholtes relaxation method for pessimistic bilevel optimization

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