Nonlinear scalarizations in set optimization with variable ordering structures and applications
The set optimization problem (P) \(F(x)\rightarrow \min\), \(x\in M\) is considered where \(X,Y\) are normed spaces and \(F:X\rightrightarrows Y\) is a set valued mapping with non empty values. The set valued mapping \(K:Y\rightrightarrows Y\) has as values pointed convex closed cones with non empty interior and defines in \(Y\) a lower type variable order structure \(A\preccurlyeq^K_l B:\Leftrightarrow B \subset \bigcup_{a\in A}(a+K(a))=: A^K\), a so called \(l\)-type set less order relation. Replacing \(K(a)\) by \(\operatorname{int} K(a)\) the strict less order relation \(\prec^K_l\) is given. \(x_0\in M\) is (weakly) optimal w.r.t. (P) if \(F(x)(\prec^K_l) \preccurlyeq^K_l F(x_0) \Longrightarrow F(x_0)(\prec^K_l) \preccurlyeq^K_l F(x)\). For some element \(e \in \bigcap_{y\in Y}\operatorname{int} K(y)\) the scalarization function \(\xi_x(A):=\inf\left\lbrace t\in \mathbb{R}: A \preccurlyeq^K_l te +F(x)\right\rbrace\) is suggested. Its monotony and order representing properties are shown and used for the characterization of optimal and weakly optimal solutions. A lot of very illustrative examples underline the importance of the used assumptions. Some results in the literature are generalized.
- A systematization of convexity and quasiconvexity concepts for set-valued maps, defined by l-type and u-type preorder relations
- A unified minimal solution in set optimization
- Bishop-Phelps cones in optimization
- Bishop–Phelps cones given by an equation in Banach spaces
- Characterizations of set order relations and constrained set optimization problems via oriented distance function
- Characterizations of variable domination structures via nonlinear scalarization
- Continuity and convexity of a nonlinear scalarizing function in set optimization problems with applications
- Convergence of solutions of a set optimization problem in the image space
- Convergence of solutions to set optimization problems with the set less order relation
- Directionally generalized differentiation for multifunctions and applications to set-valued programming problems
- External and internal stability in set optimization
- scientific article; zbMATH DE number 3874989 (Why is no real title available?)
- scientific article; zbMATH DE number 3455838 (Why is no real title available?)
- scientific article; zbMATH DE number 1377943 (Why is no real title available?)
- Karush-Kuhn-Tucker conditions in set optimization
- Minimal element theorems and Ekeland's principle with set relations
- New order relations in set optimization
- Nonconvex scalarization in set optimization with set-valued maps
- Nonconvex separation theorems and some applications in vector optimization
- Nonlinear scalarizations of set optimization problems with set orderings
- Nonlinear scalarizing functions in set optimization problems
- On set containment characterizations for sets described by set-valued maps with applications
- On set-valued optimization problems with variable ordering structure
- On solutions of set-valued optimization problems
- Optimal elements in vector optimization with a variable ordering structure
- Pointwise and global well-posedness in set optimization: a direct approach
- Pointwise well-posedness in set optimization with cone proper sets
- Scalarization in set optimization with solid and nonsolid ordering cones
- Sequential characterizations of approximate solutions in convex vector optimization problems with set-valued maps
- Set approach for set optimization with variable ordering structures. I: Set relations and relationship to vector approach
- Set approach for set optimization with variable ordering structures. II: Scalarization approaches
- Set optimization and applications -- the state of the art. From set relations to set-valued risk measures
- Set-valued analysis
- Stability of efficient solutions to set optimization problems
- Stability of minimizers of set optimization problems
- Theory of multiobjective optimization
- Variable ordering structures in vector optimization
- Vector Optimization
- Vector Optimization with Infimum and Supremum
This page was built for publication: Nonlinear scalarizations in set optimization with variable ordering structures and applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6944564)
