Optimality conditions of a set valued optimization problem with the help of directional convexificators
From MaRDI portal
Publication:4986414
DOI10.1080/02331934.2020.1725512zbMath1470.90115OpenAlexW3004502927MaRDI QIDQ4986414
M. El Idrissi, Fatima Zahra Rahou, Nazih Abderrazzak Gadhi, Lahoussine Lafhim
Publication date: 27 April 2021
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2020.1725512
optimality conditionsscalarizationsupport functiondirectional convexificatorsset valued optimization
Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46) Optimality conditions (49K99)
Related Items (4)
On variational inequalities using directional convexificators ⋮ Applying directional upper semi-regular convexificators in bilevel optimization ⋮ Optimality conditions for MPECs in terms of directional upper convexifactors ⋮ Unnamed Item
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Relative Pareto minimizers for multiobjective problems: Existence and optimality conditions
- Locally Lipschitzian set-valued maps and generalized extremal problems with inclusion constraints
- Nonsmooth calculus, minimality, and monotonicity of convexificators
- Hunting for a smaller convex subdifferential
- Optimality conditions and duality for semi-infinite mathematical programming problems with equilibrium constraints, using convexificators
- Necessary optimality conditions for optimistic bilevel programming problems using set-valued programming
- Optimality and Duality for Non-Lipschitz Multiobjective Optimization Problems
- On Subdifferentials of Optimal Value Functions
- Tangent Cones, Generalized Gradients and Mathematical Programming in Banach Spaces
- Approximate Jacobian Matrices for Nonsmooth Continuous Maps and C1-Optimization
- On lagrange-kuhn-tucker multipliers for pareto optimization problems
- Relationships Between Convexificators and Greenberg–Pierskalla Subdifferentials for Quasiconvex Functions
- Characterization of (weakly/properly/robust) efficient solutions in nonsmooth semi-infinite multiobjective optimization using convexificators
- Necessary optimality conditions for a bilevel multiobjective programming problem via a Ψ-reformulation
- Convexifactors, generalized convexity and vector optimization
- Convexificators and necessary conditions for efficiency
- Optimality conditions for maximizations of set-valued functions
This page was built for publication: Optimality conditions of a set valued optimization problem with the help of directional convexificators
