Approximate solutions and Levitin-Polyak well-posedness for set optimization using weak efficiency
type: Item
instance of: scholarly article
title: Approximate solutions and Levitin-Polyak well-posedness for set optimization using weak efficiency
zbMATH Open document ID: 1447.90072
author: Meenakshi Gupta
author: Manjari Srivastava
published in: Journal of Optimization Theory and Applications
publication date: 2020-07-14T00:00:00Z
Mathematics Subject Classification ID: 90C48
Mathematics Subject Classification ID: 90C31
Mathematics Subject Classification ID: 90C17
zbMATH DE Number: 7220282
zbMATH Keywords: set optimization
zbMATH Keywords: approximate solution
zbMATH Keywords: stability
zbMATH Keywords: well-posedness
zbMATH Keywords: set convergence
zbMATH Keywords: robust optimization
MaRDI profile type: Publication
full work available at URL: s10957-020-01683-0
OpenAlex ID: W3035871225
cites work: Set-valued optimization in welfare economics
cites work: Set Optimization—A Rather Short Introduction
cites work: Set-valued Optimization
cites work: Concepts of efficiency for uncertain multi-objective optimization problems based on set order relations
cites work: Characterizations of multiobjective robustness via oriented distance function and image space analysis
cites work: Set-valued analysis
cites work: Some duality theorems of set-valued optimization with natural criteria
cites work: Partial order relations on family of sets and scalarizations for set optimization
cites work: A note on semicontinuity of the solution mapping for parametric set optimization problems
cites work: Q3860434
cites work: \(\epsilon\)-solutions in vector minimization problems
cites work: Optimality conditions via scalarization for a new \(\epsilon \)-efficiency concept in vector optimization problems
cites work: Approximate solutions of vector optimization problems via improvement sets in real linear spaces
cites work: Approximate solutions and scalarization in set-valued optimization
cites work: Well-posed optimization problems
cites work: Q4298951
cites work: Extended well-posedness of quasiconvex vector optimization problems
cites work: Scalarization method for Levitin-Polyak well-posedness of vectorial optimization problems
cites work: Scalarization of Levitin-Polyak well-posedness in vector optimization using weak efficiency
cites work: Well-posedness for set optimization problems
cites work: Generalized \(B\)-well-posedness for set optimization problems
cites work: Pointwise and global well-posedness in set optimization: a direct approach
cites work: Characterizations of generalized Levitin-Polyak well-posed set optimization problems
cites work: Well-posedness and scalarization in set optimization involving ordering cones with possibly empty interior
cites work: Q5142516
cites work: Scalarizations for a set optimization problem using generalized oriented distance function
cites work: Q4705660
cites work: External and internal stability in set optimization
cites work: Q3304890
DOI: 10.1007/S10957-020-01683-0
description: scientific article; zbMATH DE number 7220282