Necessary optimality conditions for bilevel set optimization problems
From MaRDI portal
Publication:925230
DOI10.1007/S10898-007-9154-0zbMATH Open1190.90178OpenAlexW2076094660MaRDI QIDQ925230FDOQ925230
Authors: 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
Recommendations
- Necessary optimality conditions for bilevel optimization problems using convexificators
- Optimality conditions for optimistic bilevel programming problem using convexifactors
- Necessary optimality conditions for optimistic bilevel programming problems using set-valued programming
- First-order necessary optimality conditions for general bilevel programming problems
- Optimality Conditions for a Simple Convex Bilevel Programming Problem
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)
Cites Work
- Foundations of bilevel programming
- On the variational principle
- Optimization and nonsmooth analysis
- Title not available (Why is that?)
- Title not available (Why is that?)
- A theorem of the alternative and its application to the optimization of set-valued maps
- Contingent epiderivatives and set-valued optimization
- A multivariate partition approach to optimization problems
- Contingent derivatives of set-valued maps and applications to vector optimization
- Invex optimisation problems
- Title not available (Why is that?)
- Optimality conditions for bilevel programming problems
- Constraint Qualifications and KKT Conditions for Bilevel Programming Problems
- A generalized derivative for calm and stable functions
- Nonsmooth calculus, minimality, and monotonicity of convexificators
- Hunting for a smaller convex subdifferential
- Necessary optimality conditions for bilevel optimization problems using convexificators
- The Linear Nonconvex Generalized Gradient and Lagrange Multipliers
- Title not available (Why is that?)
- First-order necessary optimality conditions for general bilevel programming problems
- Some properties of the bilevel programming problem
- Title not available (Why is that?)
- On Subdifferentials of Optimal Value Functions
- Stochastic Optimization Methods
- On an algorithm solving two-level programming problems with nonunique lower level solutions
- On the continuity of the minimum set of a continuous function
- On Optimization Problems with Variational Inequality Constraints
- Ranking fuzzy interval numbers in the setting of random sets
- Title not available (Why is that?)
- Directional derivatives of the solution of a parametric nonlinear program
- Approximate Jacobian Matrices for Nonsmooth Continuous Maps and C1-Optimization
- Small convex-valued subdifferentials in mathematical programming
- Necessary optimality conditions for Stackelberg problems
- A necessary and a sufficient optimality condition for bilevel programming problems
- Approximate subdifferentials and applications 3: the metric theory
- On the regularity condition for the extremal problem under locally Lipschitz inclusion constraints
- Second order optimality conditions for the extremal problem under inclusion constraints
- Problems of Hierarchical Optimization in Finite Dimensions
- Title not available (Why is that?)
- On the mean value theorem
- Locally Lipschitzian set-valued maps and generalized extremal problems with inclusion constraints
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (23)
- Necessary optimality conditions in pessimistic bilevel programming
- Optimality conditions for pessimistic bilevel problems using convexificator
- Competitive facility location problem with attractiveness adjustment of the follower on the closed supply chain
- An equivalent one level optimization problem to a semivectorial bilevel problem
- Optimality Conditions for a Nonsmooth Semivectorial Bilevel Optimization Problem
- Optimality conditions for a bilevel optimization problem in terms of KKT multipliers and convexificators
- Tensor completion via bilevel minimization with fixed-point constraint to estimate missing elements in noisy data
- A new equivalent single-level problem for bilevel problems
- Necessary optimality conditions for a set-valued fractional extremal programming problem under inclusion constraints
- Applying directional upper semi-regular convexificators in bilevel optimization
- Necessary optimality conditions for optimistic bilevel programming problems using set-valued programming
- Fuzzy and exact optimality conditions for a bilevel set-valued problem via extremal principles
- Necessary optimality conditions for a bilevel multiobjective programming problem via a \(\Psi\)-reformulation
- Necessary optimality conditions and a new approach to multiobjective bilevel optimization problems
- Applying convexificators in robust multiobjective optimization
- Necessary optimality conditions for bilevel optimization problems using convexificators
- Necessary optimality conditions for a semivectorial bilevel optimization problem using the kth-objective weighted-constraint approach
- Bilevel optimization: on the structure of the feasible set
- Second order optimality conditions for a bilevel optimization problem in terms of approximate Hessians
- New optimality conditions for bilevel programs by using an exact separation principle
- Necessary optimality conditions of a D.C. set-valued bilevel optimization problem
- Optimality results for a specific bilevel optimization problem
- Bilevel optimization: theory, algorithms, applications and a bibliography
This page was built for publication: Necessary optimality conditions for bilevel set optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q925230)
