Necessary optimality conditions for bilevel set optimization problems
From MaRDI portal
Publication:925230
DOI10.1007/s10898-007-9154-0zbMath1190.90178OpenAlexW2076094660MaRDI QIDQ925230
Stephan Dempe, Nazih Abderrazzak Gadhi
Publication date: 3 June 2008
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-007-9154-0
Bilevel optimizationConvexificatorKarush-Kuhn-Tucker multipliersNecessary Optimality conditionsRegularity conditionSet valued mappingsSupport function
Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46)
Related Items
Optimality conditions for pessimistic bilevel problems using convexificator ⋮ Necessary optimality conditions for a set-valued fractional extremal programming problem under inclusion constraints ⋮ Applying convexificators in robust multiobjective optimization ⋮ Applying directional upper semi-regular convexificators in bilevel optimization ⋮ New optimality conditions for bilevel programs by using an exact separation principle ⋮ Necessary optimality conditions for a semivectorial bilevel optimization problem using the kth-objective weighted-constraint approach ⋮ Optimality conditions for a bilevel optimization problem in terms of KKT multipliers and convexificators ⋮ An equivalent one level optimization problem to a semivectorial bilevel problem ⋮ Necessary optimality conditions for a bilevel multiobjective programming problem via a Ψ-reformulation ⋮ A new equivalent single-level problem for bilevel problems ⋮ Tensor completion via bilevel minimization with fixed-point constraint to estimate missing elements in noisy data ⋮ Fuzzy and Exact Optimality Conditions for a Bilevel Set-Valued Problem via Extremal Principles ⋮ Competitive facility location problem with attractiveness adjustment of the follower on the closed supply chain ⋮ Optimality Conditions for a Nonsmooth Semivectorial Bilevel Optimization Problem ⋮ Second order optimality conditions for a bilevel optimization problem in terms of approximate Hessians ⋮ Optimality results for a specific bilevel optimization problem ⋮ Necessary optimality conditions for optimistic bilevel programming problems using set-valued programming ⋮ Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Some properties of the bilevel programming problem
- Locally Lipschitzian set-valued maps and generalized extremal problems with inclusion constraints
- On the regularity condition for the extremal problem under locally Lipschitz inclusion constraints
- A generalized derivative for calm and stable functions
- A theorem of the alternative and its application to the optimization of set-valued maps
- Nonsmooth calculus, minimality, and monotonicity of convexificators
- Necessary optimality conditions for Stackelberg problems
- Hunting for a smaller convex subdifferential
- Contingent epiderivatives and set-valued optimization
- A multivariate partition approach to optimization problems
- Second order optimality conditions for the extremal problem under inclusion constraints
- Foundations of bilevel programming
- Ranking fuzzy interval numbers in the setting of random sets
- On an algorithm solving two-level programming problems with nonunique lower level solutions
- On the variational principle
- Directional derivatives of the solution of a parametric nonlinear program
- Necessary optimality conditions for bilevel optimization problems using convexificators
- On the continuity of the minimum set of a continuous function
- Contingent derivatives of set-valued maps and applications to vector optimization
- Approximate subdifferentials and applications 3: the metric theory
- On Subdifferentials of Optimal Value Functions
- Optimization and nonsmooth analysis
- On the mean value theorem
- Invex optimisation problems
- Approximate Jacobian Matrices for Nonsmooth Continuous Maps and C1-Optimization
- On Optimization Problems with Variational Inequality Constraints
- Problems of Hierarchical Optimization in Finite Dimensions
- A necessary and a sufficient optimality condition for bilevel programming problems
- Small convex-valued subdifferentials in mathematical programming
- Stochastic Optimization Methods
- Optimality conditions for bilevel programming problems
- The Linear Nonconvex Generalized Gradient and Lagrange Multipliers
- Constraint Qualifications and KKT Conditions for Bilevel Programming Problems
- First-order necessary optimality conditions for general bilevel programming problems
