Vector optimization w.r.t. relatively solid convex cones in real linear spaces

DOI10.1007/s10957-021-01976-yzbMath1493.90227OpenAlexW4200200616MaRDI QIDQ2139264

Christian Günther, Bahareh Khazayel, Christiane Tammer

Publication date: 17 May 2022

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10957-021-01976-y

zbMATH Keywords

vector optimizationscalarizationseparation theoremHenig proper efficiencyintrinsic core(weak) Pareto efficiencygeneralized dilating conesrelatively solid convex cone

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Programming in abstract spaces (90C48) Ordered abelian groups, Riesz groups, ordered linear spaces (06F20) Convex sets without dimension restrictions (aspects of convex geometry) (52A05)

Related Items

Vectorial penalisation in vector optimisation in real linear-topological spaces, Nonlinear Cone Separation Theorems in Real Topological Linear Spaces

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Properly optimal elements in vector optimization with variable ordering structures
• Proper efficiency in vector optimization on real linear spaces.
• Relative Pareto minimizers for multiobjective problems: Existence and optimality conditions
• Duality related to approximate proper solutions of vector optimization problems
• Efficiency and proper efficiency in vector maximization with respect to cones
• Proper efficiency with respect to cones
• Partially finite convex programming. I: Quasi relative interiors and duality theory
• On the notion of proper efficiency in vector optimization
• Density theorems for generalized Henig proper efficiency
• Weak efficiency in vector optimization using a closure of algebraic type under cone-convexlikeness.
• Notions of relative interior in Banach spaces
• Efficient and weak efficient points in vector optimization with generalized cone convexity
• Characterizations via linear scalarization of minimal and properly minimal elements
• Some perspectives on vector optimization via image space analysis
• Unifying local-global type properties in vector optimization
• On relatively solid convex cones in real linear spaces
• Henig proper efficiency in vector optimization with variable ordering structure
• Explicitly quasiconvex set-valued optimization
• Constrained optimization and image space analysis. Vol. 1: Separation of sets and optimality conditions
• Proper efficiency and the theory of vector maximization
• On the use of the quasi-relative interior in optimization
• Vector Optimization and Monotone Operators via Convex Duality
• Vector Optimization
• New algorithms for discrete vector optimization based on the Graef-Younes method and cone-monotone sorting functions
• Duality in Vector Optimization
• Pareto Subdifferential Calculus for Convex Vector Mappings and Applications to Vector Optimization
• Proper Efficient Points for Maximizations with Respect to Cones
• On Cone-Efficiency, Cone-Convexity and Cone-Compactness
• Vector Variational Inequalities and Vector Optimization
• Super efficiency in convex vector optimization
• A new ABB theorem in normed vector spaces
• On the Intrinsic Core of Convex Cones in Real Linear Spaces
• Algebraic core and convex calculus without topology
• Set-valued Optimization
• Vector duality for convex vector optimization problems by means of the quasi-interior of the ordering cone
• Optimality conditions of set-valued optimization problem involving relative algebraic interior in ordered linear spaces