A vectorization for nonconvex set-valued optimization
From MaRDI portal
Abstract: Vectorization is a technique that replaces a set-valued optimization problem with a vector optimization problem. In this work, by using an extension of Gerstewitz function [1], a vectorizing function is defined to replace a given set-valued optimization problem with respect to set less order relation. Some properties of this function are studied. Also, relationships between a set-valued optimization problem and a vector optimization problem, derived via vectorization of this set-valued optimization problem, are examined. Furthermore, necessary and sufficient optimality conditions are presented without any convexity assumption.
Recommendations
- Vectorization in set optimization
- Scalarization of set-valued optimization problems in normed spaces
- A Vectorization Scheme for Nonconvex Set Optimization Problems
- Vectorization of set-valued maps with respect to total ordering cones and its applications to set-valued optimization problems
- Scalarization in vector optimization
Cites work
- A new approach to duality in vector optimization
- A new nonlinear scalarization function and applications
- Conjugate duality in vector optimization
- Conjugate duality in vector optimization and some applications to the vector variational inequality
- Duality for set-valued measures of risk
- Existence theorems of set optimization with set-valued maps
- scientific article; zbMATH DE number 3886197 (Why is no real title available?)
- scientific article; zbMATH DE number 3855514 (Why is no real title available?)
- scientific article; zbMATH DE number 2063780 (Why is no real title available?)
- scientific article; zbMATH DE number 1377943 (Why is no real title available?)
- Multicriteria Optimization
- New order relations in set optimization
- Nonconvex scalarization in set optimization with set-valued maps
- Nonconvex separation theorems and some applications in vector optimization
- On cone convexity of set-valued maps
- Optimality conditions for set-valued optimization problems
- Optimization. Algorithms and consistent approximations
- Pareto optimality, game theory and equilibria
- Scalarization in set optimization with solid and nonsolid ordering cones
- Set-valued optimization. An introduction with applications
- The generalization of total ordering cones and vectorization to separable Hilbert spaces
- Treatment of set order relations by means of a nonlinear scalarization functional: a full characterization
- Vectorization in set optimization
- Vectorization of set-valued maps with respect to total ordering cones and its applications to set-valued optimization problems
- Weak conjugate duality for nonconvex vector optimization
Cited in
(10)- Some optimality criteria of interval programming problems
- Characterizations of the set less order relation in nonconvex set optimization
- Optimality conditions in set-valued optimization problem with respect to a partial order relation via directional derivative
- Vectorization in set optimization
- Optimality conditions in set-valued optimization problems with respect to a partial order relation by using subdifferentials
- A Vectorization Scheme for Nonconvex Set Optimization Problems
- Conjugate duality in set optimization via nonlinear scalarization
- Optimality and error bound for set optimization with application to uncertain multi-objective programming
- Vectorization of set-valued maps with respect to total ordering cones and its applications to set-valued optimization problems
- Nonconvex scalarization in set optimization with set-valued maps
This page was built for publication: A vectorization for nonconvex set-valued optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5742726)
