A systematization of convexity and quasiconvexity concepts for set-valued maps, defined byl-type andu-type preorder relations

Convex programming (90C25) Convexity of real functions of several variables, generalizations (26B25) Convex functions and convex programs in convex geometry (52A41)

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Variational methods in partially ordered spaces
Generalized quasiconvexities, cone saddle points, and minimax theorem for vector-valued functions
Characterizations of convex and quasiconvex set-valued maps
Convexity for set-valued maps
Vector Optimization
Multivalued convexity and optimization: A unified approach to inequality and equality constraints
Set-valued Optimization
Regularity and Stability for Convex Multivalued Functions
Quasiconvexity of set-valued maps assures well-posedness of robust vector optimization
Representations of affine multifunctions by affine selections
A saddlepoint theorem for set-valued maps
Minimax type theorems for n-valued functions
Generalized Quasiconvex Mappings and Vector Optimization
A characterization of cone-convexity for set-valued functions by cone-quasiconvexity
Generalized Minimality in Set Optimization

Cited In (11)

New concepts of directional derivatives for set-valued maps and applications to set optimization
Six set scalarizations based on the oriented distance: properties and application to set optimization
Well-posedness and stability in set optimization with applications
Connectedness of the approximate solution sets for set optimization problems
Generalized \({\varepsilon }\)-quasi solutions of set optimization problems
Stability of efficient solutions to set optimization problems
On the convexity of preferences in decisions and games under (quasi-)convex/concave imprecise probability correspondences
Existence and connectedness of the \(l\)-minimal approximate solutions for set optimization problems: an application in generalized multiobjective robustness
Global well-posedness of set-valued optimization with application to uncertain problems
On the stability of minimal solutions for parametric set optimization problems
Global Well-Posedness in Set Optimization

This page was built for publication: A systematization of convexity and quasiconvexity concepts for set-valued maps, defined byl-type andu-type preorder relations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3177622)