The generalization of total ordering cones and vectorization to separable Hilbert spaces

DOI10.1016/j.jmaa.2012.01.017zbMath1261.90051OpenAlexW2020363859MaRDI QIDQ764974

Yalçın Küçük, Mustafa Soyertem, Küçük, Mahide

Publication date: 16 March 2012

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0022247X12000339

zbMATH Keywords

vector optimizationscalarizationseparable Hilbert spaceset-valued optimizationtotal ordering cone

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29)

Related Items (5)

Various types of well-posedness for vector equilibrium problems with respect to the lexicographic order ⋮ A lexicographical order induced by Schauder bases ⋮ A vectorization for nonconvex set-valued optimization ⋮ Some optimality criteria of interval programming problems ⋮ Step-affine functions, halfspaces, and separation of convex sets with applications to convex optimization problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On constructing total orders and solving vector optimization problems with total orders
• Vectorization of set-valued maps with respect to total ordering cones and its applications to set-valued optimization problems
• Pareto optimality, game theory and equilibria
• Existence theorems in vector optimization
• Optimality conditions for set-valued optimization problems
• A survey of recent developments in multiobjective optimization
• On the Scalarization of Set-Valued Optimization Problems with Respect to Total Ordering Cones
• Multicriteria Optimization

This page was built for publication: The generalization of total ordering cones and vectorization to separable Hilbert spaces