Necessary optimality conditions of a D.C. set-valued bilevel optimization problem
From MaRDI portal
Publication:5505159
DOI10.1080/02331930701761508zbMath1152.90587OpenAlexW2071620379MaRDI QIDQ5505159
Stephan Dempe, Nazih Abderrazzak Gadhi
Publication date: 23 January 2009
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331930701761508
necessary optimality conditionsset-valued mappingsseparation principlesupport functionbilevel optimizationsub-differentialweak subdifferentialKarush-Kuhn-Tucker multipliers
Related Items (5)
Optimization of first-order Nicoletti boundary value problem with discrete and differential inclusions and duality ⋮ Polyhedral optimization of discrete and partial differential inclusions of parabolic type ⋮ Characterization and recognition of d.c. functions ⋮ Necessary optimality conditions for bilevel minimization problems ⋮ Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography
Cites Work
- Unnamed Item
- Optimality conditions for vector optimization problems of a difference of convex mappings
- Optimality conditions for D.C. vector optimization problems under reverse convex constraints
- Optimality conditions for the difference of convex set-valued mappings
- Some properties of the bilevel programming problem
- Conjugate maps and duality in multiobjective optimization
- On subdifferentials of set-valued maps
- Nonsmooth calculus, minimality, and monotonicity of convexificators
- Necessary optimality conditions for Stackelberg problems
- Optimization of set-valued functions
- Contingent epiderivatives and set-valued optimization
- Subdifferentials of multifunctions and Lagrange multipliers for multiobjective optimization.
- A multivariate partition approach to optimization problems
- Second order optimality conditions for the extremal problem under inclusion constraints
- On the regularity condition for vector programming problems
- Necessary optimality conditions for bilevel optimization problems using convexificators
- On Subdifferentials of Optimal Value Functions
- Problems of Hierarchical Optimization in Finite Dimensions
- A necessary and a sufficient optimality condition for bilevel programming problems
- Optimality conditions for bilevel programming problems
- First-order necessary optimality conditions for general bilevel programming problems
This page was built for publication: Necessary optimality conditions of a D.C. set-valued bilevel optimization problem