Optimality conditions for a bilevel optimization problem in terms of KKT multipliers and convexificators
From MaRDI portal
Publication:5147635
DOI10.17535/crorr.2019.0026zbMath1469.90139OpenAlexW2994922825MaRDI QIDQ5147635
Nazih Abderrazzak Gadhi, Lahoussine Lafhim
Publication date: 27 January 2021
Published in: Croatian Operational Research Review (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.17535/crorr.2019.0026
Cites Work
- Optimality conditions for optimistic bilevel programming problem using convexifactors
- Convexifactors, generalized convexity, and optimality conditions
- Necessary optimality conditions for bilevel set optimization problems
- Subgradients of marginal functions in parametric mathematical programming
- A generalized derivative for calm and stable functions
- Nonsmooth calculus, minimality, and monotonicity of convexificators
- Practical bilevel optimization. Algorithms and applications
- Hunting for a smaller convex subdifferential
- Variational methods in partially ordered spaces
- Foundations of bilevel programming
- Annotated Bibliography on Bilevel Programming and Mathematical Programs with Equilibrium Constraints
- Optimality conditions for bilevel programming problems
- Solving bi-level programming problem with fuzzy random variable coefficients
- Variational Stability and Marginal Functions via Generalized Differentiation
- New necessary optimality conditions in optimistic bilevel programming
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Optimality conditions for a bilevel optimization problem in terms of KKT multipliers and convexificators