The relationship between multi-objective robustness concepts and set-valued optimization
From MaRDI portal
Publication:2264185
DOI10.1186/1687-1812-2014-83zbMath1333.90118OpenAlexW2132406365WikidataQ59394668 ScholiaQ59394668MaRDI QIDQ2264185
Anita Schöbel, Daishi Kuroiwa, Jonas Ide, Christiane Tammer, Elisabeth Köbis
Publication date: 20 March 2015
Published in: Fixed Point Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1186/1687-1812-2014-83
Related Items
Using KKM technique in set-valued optimization problems and variational-like inequalities, Strict efficiency conditions for nonsmooth optimization with inclusion constraint under Hölder directional metric subregularity, Robust efficiency and well-posedness in uncertain vector optimization problems, Well-posedness for the optimistic counterpart of uncertain vector optimization problems, Dominance for multi-objective robust optimization concepts, Minmax robustness for multi-objective optimization problems, Robust solutions to multi-objective linear programs with uncertain data, Optimality conditions for robust nonsmooth multiobjective optimization problems in asplund spaces, Convergence of solutions of a set optimization problem in the image space, An approximation algorithm for multi-objective optimization problems using a box-coverage, Bi-objective robust optimisation, Robust Nash equilibria in vector-valued games with uncertainty, Characterizations of set relations with respect to variable domination structures via oriented distance function, A Vectorization Scheme for Nonconvex Set Optimization Problems, Quasiconvexity of set-valued maps assures well-posedness of robust vector optimization, An algorithmic approach to multiobjective optimization with decision uncertainty, Approximate elements for set optimization problems with respect to variable domination structures, Decision uncertainty in multiobjective optimization, On nonsmooth robust multiobjective optimization under generalized convexity with applications to portfolio optimization, Necessary and sufficient conditions for Pareto efficiency in robust multiobjective optimization, Best-case scenario robust portfolio: evidence from China stock market, Characterizations of multiobjective robustness via oriented distance function and image space analysis, Characterizations of set order relations and nonlinear scalarizations via generalized oriented distance function in set optimization, Concepts of efficiency for uncertain multi-objective optimization problems based on set order relations, Conjugate duality in set optimization via nonlinear scalarization, Characterizations of multi-objective robustness solutions defined by Minkowski set difference, Robust multiobjective portfolio optimization: a set order relations approach, Characterization of Set Relations by Means of a Nonlinear Scalarization Functional, Global well-posedness of set-valued optimization with application to uncertain problems, Proper Efficiency and Tradeoffs in Multiple Criteria and Stochastic Optimization, Unnamed Item, Primal worst and dual best in robust vector optimization, Robustness in deterministic vector optimization, A steepest descent method for set optimization problems with set-valued mappings of finite cardinality, Scalarization of multiobjective robust optimization problems, Multiobjective optimization under uncertainty: a multiobjective robust (relative) regret approach, A unified approach to uncertain optimization, Guaranteeing highly robust weakly efficient solutions for uncertain multi-objective convex programs, On robustness for set-valued optimization problems, Lagrange Multiplier Rules for Weakly Minimal Solutions of Compact-Valued Set Optimization Problems, Robust counterparts and robust efficient solutions in vector optimization under uncertainty, Multi-objective minmax robust combinatorial optimization with cardinality-constrained uncertainty, Extensions of labeling algorithms for multi‐objective uncertain shortest path problems, Robustness for uncertain multi-objective optimization: a survey and analysis of different concepts, Coderivative necessary optimality conditions for sharp and robust efficiencies in vector optimization with variable ordering structure, Treatment of set order relations by means of a nonlinear scalarization functional: a full characterization, On approximate solutions for nonsmooth robust multiobjective optimization problems, Scalarization and robustness in uncertain vector optimization problems: a non componentwise approach
Cites Work
- Minmax robustness for multi-objective optimization problems
- Concepts of efficiency for uncertain multi-objective optimization problems based on set order relations
- New order relations in set optimization
- Proximal point methods for monotone operators in Banach spaces
- Robust discrete optimization and its applications
- Variational methods in partially ordered spaces
- The algebra of many-valued quantities
- On set-valued optimization.
- On robust multiobjective optimization
- Robust Convex Optimization
- A unified approach for different concepts of robustness and stochastic programming via non-linear scalarizing functionals
- Vector Optimization Problems and Their Solution Concepts
- A Scenario-Based Approach for Robust Linear Optimization
- The Concept of Recoverable Robustness, Linear Programming Recovery, and Railway Applications
- Light Robustness
- Introduction to Stochastic Programming
- Existence theorems of set optimization with set-valued maps
- Multicriteria Optimization
- Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
