A systematization of convexity and quasiconvexity concepts for set-valued maps, defined byl-type andu-type preorder relations
DOI10.1080/02331934.2018.1454920zbMath1411.52005OpenAlexW2794811663MaRDI QIDQ3177622
Kazuki Seto, Daishi Kuroiwa, Nicolae Popovici
Publication date: 1 August 2018
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2018.1454920
set-valued optimizationaffine perturbationquasiconvex set-valued mapsl-type and u-type preorder relations
Convex programming (90C25) Convex functions and convex programs in convex geometry (52A41) Convexity of real functions of several variables, generalizations (26B25)
Related Items (10)
Cites Work
- Representations of affine multifunctions by affine selections
- Generalized quasiconvexities, cone saddle points, and minimax theorem for vector-valued functions
- Variational methods in partially ordered spaces
- Characterizations of convex and quasiconvex set-valued maps
- Minimax type theorems for n-valued functions
- Convexity for set-valued maps
- A characterization of cone-convexity for set-valued functions by cone-quasiconvexity
- Quasiconvexity of set-valued maps assures well-posedness of robust vector optimization
- Generalized Minimality in Set Optimization
- Vector Optimization
- Generalized Quasiconvex Mappings and Vector Optimization
- Regularity and Stability for Convex Multivalued Functions
- A saddlepoint theorem for set-valued maps
- Multivalued convexity and optimization: A unified approach to inequality and equality constraints
- Set-valued Optimization
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A systematization of convexity and quasiconvexity concepts for set-valued maps, defined byl-type andu-type preorder relations