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

DOI10.1016/J.JMAA.2012.01.017zbMATH Open1261.90051OpenAlexW2020363859MaRDI QIDQ764974FDOQ764974

Authors: Mustafa Soyertem, Yalçin Küçük, Mahide Küçük 

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

Recommendations

• On constructing total orders and solving vector optimization problems with total orders
• On the scalarization of set-valued optimization problems with respect to total ordering cones
• Vectorization of set-valued maps with respect to total ordering cones and its applications to set-valued optimization problems
• scientific article; zbMATH DE number 4075804
• scientific article; zbMATH DE number 1779299

zbMATH Keywords

scalarizationset-valued optimizationvector optimizationseparable Hilbert spacetotal ordering cone

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29)

Cites Work

• Optimality conditions for set-valued optimization problems
• Title not available (Why is that?)
• Multicriteria Optimization
• Title not available (Why is that?)
• On constructing total orders and solving vector optimization problems with total orders
• A survey of recent developments in multiobjective optimization
• Pareto optimality, game theory and equilibria
• Some duality theorems of set-valued optimization with natural criteria
• Existence theorems in vector optimization
• On the scalarization of set-valued optimization problems with respect to total ordering cones
• Vectorization of set-valued maps with respect to total ordering cones and its applications to set-valued optimization problems

Cited In (8)

• On the scalarization of set-valued optimization problems with respect to total ordering cones
• The minimal Hilbert basis of the Hammond order cone
• A lexicographical order induced by Schauder bases
• Title not available (Why is that?)
• 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
• Various types of well-posedness for vector equilibrium problems with respect to the lexicographic order

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

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