Stability and scalarization in vector optimization using improvement sets
type: Item
instance of: scholarly article
title: Stability and scalarization in vector optimization using improvement sets
zbMATH Open document ID: 1342.49035
author: C. S. Lalitha
author: Prashanto Chatterjee
published in: Journal of Optimization Theory and Applications
publication date: 2015-09-15T00:00:00Z
review text: Assume that \(X\) and \(Y\) are normed linear spaces and \(K\) is a proper, closed, convex, pointed cone in \(Y\) with nonempty interior. A nonempty set \(E \subseteq Y\) is said to be an improvement set iff (i) \(0\not\in E\) and (ii) \(E+K=E\). When \(E\) is an improvement set, then an element \(y\in A\subset Y \) is said to be (i) an \(E\)-minimal solution of \(A\) iff \[ (A-y)\cap (-E )=\emptyset, \] (ii) a weak \(E\)-minimal solution of \(A\) iff \[ (A-y)\cap (-\mathrm{int }E )=\emptyset. \] The set of \(E\)-minimal solutions of \(A\) and the set of weak \(E\)-minimal solutions of \(A\) are denoted by \(O^E(A)\) and \(O^{\mathrm{int }E}(A ),\) respectively. Let \(f: X \rightarrow Y\) be a function and \(\emptyset\neq S \subset X\) be a closed set. The vector optimization problem (P) is given as \[ \min_ {x\in S} f (x). \] The sets of \(E\)-minimal and weak \(E\)-minimal solutions of (P) are denoted by \(O^E (f (S))\) and \(O^{\mathrm{int }E} (f (S)),\) respectively. An element \(x\in S\) is said to be an \(E\)-optimal solution of (P) iff \(f (x )\in O^E (f (S))\) and is said to be a weak \(E\)-optimal solution of (P) iff \(f (x )\in O^{\mathrm{int } E} (f (S)), \) respectively. In this article, the authors established the lower and upper set-convergences of \(E\)-optimal and weak \(E\)-optimal solution sets of perturbed nonconvex vector problems in the sense of Painlevé-Kuratowski. In fact, they investigated the stability of \(E\)-optimal solution sets of a family of perturbed vector problems in terms of Painlevé-Kuratowski set-convergence. Furthermore, they studied these convergences through the set-convergences of the approximate solution sets of certain scalarized problems by using a nonlinear scalarization function defined in terms of an improvement set.
Mathematics Subject Classification ID: 49K40
Mathematics Subject Classification ID: 49J53
Mathematics Subject Classification ID: 90C26
Mathematics Subject Classification ID: 90C29
Mathematics Subject Classification ID: 90C31
zbMATH DE Number: 6482311
zbMATH Keywords: vector optimization
zbMATH Keywords: stability
zbMATH Keywords: scalarization
zbMATH Keywords: Painlevé-Kuratowski set-convergence
zbMATH Keywords: improvement sets
zbMATH Keywords: uniform boundedness
zbMATH Keywords: minimal solutions
reviewed by: Jafar Zafarani
MaRDI profile type: Publication
full work available at URL: s10957-014-0686-4
OpenAlex ID: W2154078976
cites work: Stability for convex vector optimization problems
cites work: Stability and scalarization of weak efficient, efficient and Henig proper efficient sets using generalized quasiconvexities
cites work: Scalarization of vector optimization problems
cites work: Characterization of solutions of multiobjective optimization problem
cites work: Scalarization of Henig properly efficient points in locally convex spaces
cites work: Well-posedness and scalarization in vector optimization
cites work: Scalarization of Levitin-Polyak well-posedness in vector optimization using weak efficiency
cites work: Q3340523
cites work: Scalarization and nonlinear scalar duality for vector optimization with preferences that are not necessarily a pre-order relation
cites work: A Unified Approach and Optimality Conditions for Approximate Solutions of Vector Optimization Problems
cites work: Optimality conditions via scalarization for a new \(\epsilon \)-efficiency concept in vector optimization problems
cites work: A generic approach to approximate efficiency and applications to vector optimization with set-valued maps
cites work: Vector optimization problems via improvement sets
cites work: Q5588318
cites work: Theorems of the alternative and optimality conditions
cites work: Constrained optimization and image space analysis. Vol. 1: Separation of sets and optimality conditions
cites work: New proof of a theorem of F. Giannessi
cites work: Nonconvex scalarization in set optimization with set-valued maps
cites work: Optimality conditions for a unified vector optimization problem with not necessarily preordering relations
cites work: A unified stability result with perturbations in vector optimization
cites work: Improvement sets and vector optimization
cites work: Variational Analysis
cites work: Stability for properly quasiconvex vector optimization problem
cites work: Continuity Results for a Class of Variational Inequalities with Applications to Time-Dependent Network Problems
cites work: On the Convergence of Sequences of Convex Sets in Finite Dimensions
DOI: 10.1007/S10957-014-0686-4
Recommended article: Scalarization and stability in vector optimization
Recommended article: Vector equilibrium problems under improvement sets and linear scalarization with stability applications
Recommended article: Vector optimization problems via improvement sets
Recommended article: Improvement sets and vector optimization
Recommended article: Stability and scalarization for a unified vector optimization problem
Recommended article: Stability in vector-valued and set-valued optimization
Recommended article: A characterization of improvement set in vector optimization
Recommended article: Q3475916
Recommended article: Vector optimization using improvement sets in locally convex spaces
description: scientific article; zbMATH DE number 6482311