Strict efficiency in set optimization studied with the set approach
From MaRDI portal
Cites work
- A Hausdorff-type distance, a directional derivative of a set-valued map and applications in set optimization
- A unified scheme for scalarization in set optimization
- Convexity for set-valued maps
- Directional and approximate efficiency in set optimization
- Directional derivatives and subdifferentials for set-valued maps applied to set optimization
- Directional derivatives and subdifferentials of set-valued convex functions
- Directional derivatives in set optimization with the set less order relation
- Existence and density results for proper efficiency in cone compact sets
- First-order optimality conditions in set-valued optimization
- From scalar to vector optimization.
- Generalized \({\varepsilon }\)-quasi solutions of set optimization problems
- Higher-order optimality conditions for strict minimality in set-valued otimization
- Higher-order optimality conditions in set-valued optimization with respect to general preference mappings
- scientific article; zbMATH DE number 4044567 (Why is no real title available?)
- scientific article; zbMATH DE number 3737398 (Why is no real title available?)
- scientific article; zbMATH DE number 2063780 (Why is no real title available?)
- scientific article; zbMATH DE number 1379225 (Why is no real title available?)
- Isolated minimizers and proper efficiency for \(C^{0,1}\) constrained vector optimization problems
- Necessary and Sufficient Conditions for Isolated Local Minima of Nonsmooth Functions
- New concepts of directional derivatives for set-valued maps and applications to set optimization
- New order relations in set optimization
- On set-valued optimization.
- Remarks on strict efficiency in scalar and vector optimization
- Slopes, error bounds and weak sharp Pareto minima of a vector-valued map
- Stability in Mathematical Programming with Nondifferentiable Data
- Strict efficiency in set-valued optimization
- Strict efficiency in vector optimization
- Strict minimality conditions in nondifferentiable multiobjective programming
- Subdifferential calculus and ideal solutions for set optimization problems
- The Lipschitzianity of convex vector and set-valued functions
- Weak sharp efficiency and growth condition for vector-valued functions with applications
This page was built for publication: Strict efficiency in set optimization studied with the set approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6998511)
