arXiv Analytics

Sign in

arXiv:2410.10026 [math.OC]AbstractReferencesReviewsResources

Bishop-Phelps Type Scalarization for Vector Optimization in Real Topological-Linear Spaces

Christian Günther, Bahareh Khazayel, Radu Strugariu, Christiane Tammer

Published 2024-10-13Version 1

It is well-known that scalarization techniques (e.g., in the sense of Gerstewitz; Kasimbeyli; Pascoletti and Serafini; Zaffaroni) are useful for generating (weakly, properly) efficient solutions of vector optimization problems. One recognized approach is the conic scalarization method in vector optimization in real normed spaces proposed by Kasimbeyli (2010, SIAM J Optim 20), which is based on augmented dual cones and Bishop-Phelps type (norm-linear) scalarizing functions. In this paper, we present new results on cone separation in real topological-linear spaces by using Bishop-Phelps type separating cones / separating seminorm-linear functions. Moreover, we study some extensions of known scalarization results in vector optimization (in the sense of Eichfelder; Gerstewitz; Jahn; Kasimbeyli; Pascoletti and Serafini). On this basis, we propose a Bishop-Phelps type scalarization method for vector optimization problems in real topological-linear spaces, which can be seen as an extension of Kasimbeyli's conic scalarization method in real normed spaces. Within this framework, we derive new Bishop-Phelps type scalarization results for the concepts of weak efficiency and different types of proper efficiency.

Related articles: Most relevant | Search more
arXiv:2407.13245 [math.OC] (Published 2024-07-18)
Descent Methods for Vector Optimization Problems: A Majorization-Minimization Perspective
arXiv:2101.12542 [math.OC] (Published 2021-01-29)
On some efficiency conditions for vector optimization problems with uncertain cone constraints: a robust approach
arXiv:2105.14312 [math.OC] (Published 2021-05-29)
A Perturbation Approach to Vector Optimization Problems: Lagrange and Fenchel-Lagrange Duality