The relationship between multi-objective robustness concepts and set-valued optimization
From MaRDI portal
Recommendations
- Generalized multiobjective robustness and relations to set-valued optimization
- On robustness for set-valued optimization problems
- Concepts of robustness for uncertain multi-objective optimization
- On robust multiobjective optimization
- Robustness for uncertain multi-objective optimization: a survey and analysis of different concepts
- On robust convex multiobjective optimization
- Optimality and duality for robust multiobjective optimization problems
- A variational approach to define robustness for parametric multiobjective optimization problems
- The price of multiobjective robustness: analyzing solution sets to uncertain multiobjective problems
- scientific article; zbMATH DE number 1471749
Cites work
- A scenario-based approach for robust linear optimization
- A unified approach for different concepts of robustness and stochastic programming via non-linear scalarizing functionals
- Concepts of efficiency for uncertain multi-objective optimization problems based on set order relations
- Existence theorems of set optimization with set-valued maps
- scientific article; zbMATH DE number 3925652 (Why is no real title available?)
- scientific article; zbMATH DE number 1377943 (Why is no real title available?)
- Introduction to nonlinear and convex analysis
- Introduction to Stochastic Programming
- Light robustness
- Minmax robustness for multi-objective optimization problems
- Multicriteria Optimization
- New order relations in set optimization
- Nonlinear functional analysis. Fixed point theory and its applications
- Nonlinear mappings in equilibrium problems and an open problem in fixed point theory
- On robust convex multiobjective optimization
- On robust multiobjective optimization
- On set-valued optimization.
- Proximal point methods for monotone operators in Banach spaces
- Robust convex optimization
- Robust discrete optimization and its applications
- Robust optimization
- Some duality theorems of set-valued optimization with natural criteria
- Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
- The algebra of many-valued quantities
- The concept of recoverable robustness, linear programming recovery, and railway applications
- Variational methods in partially ordered spaces
- Vector optimization problems and their solution concepts
Cited in
(70)- Dominance for multi-objective robust optimization concepts
- 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
- Primal worst and dual best in robust vector optimization
- Robustness in deterministic vector optimization
- A unified approach to uncertain optimization
- Guaranteeing highly robust weakly efficient solutions for uncertain multi-objective convex programs
- Robust counterparts and robust efficient solutions in vector optimization under uncertainty
- Scalarization of multiobjective robust optimization problems
- On robustness for set-valued optimization problems
- Scalarization and robustness in uncertain vector optimization problems: a non componentwise approach
- Optimality conditions for robust nonsmooth multiobjective optimization problems in asplund spaces
- An approximation algorithm for multi-objective optimization problems using a box-coverage
- Robust Nash equilibria in vector-valued games with uncertainty
- An algorithmic approach to multiobjective optimization with decision uncertainty
- A steepest descent method for set optimization problems with set-valued mappings of finite cardinality
- Multiobjective optimization under uncertainty: a multiobjective robust (relative) regret approach
- Generalized multiobjective robustness and relations to set-valued optimization
- Three concepts of robust efficiency for uncertain multiobjective optimization problems via set order relations
- Quasiconvexity of set-valued maps assures well-posedness of robust vector optimization
- Characterizations of multiobjective robustness via oriented distance function and image space analysis
- Robust multiobjective portfolio optimization: a set order relations approach
- Robust solutions to multi-objective linear programs with uncertain data
- Using KKM technique in set-valued optimization problems and variational-like inequalities
- Characterizations of set order relations and nonlinear scalarizations via generalized oriented distance function in set optimization
- Global well-posedness of set-valued optimization with application to uncertain problems
- Concepts of robustness for uncertain multi-objective optimization
- 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
- Minmax robustness for multi-objective optimization problems
- Proper Efficiency and Tradeoffs in Multiple Criteria and Stochastic Optimization
- Convergence of solutions of a set optimization problem in the image space
- Bi-objective robust optimisation
- The weighted set relation: characterizations in the convex case
- Concepts of efficiency for uncertain multi-objective optimization problems based on set order relations
- Characterizations of set relations with respect to variable domination structures via oriented distance function
- Extensions of labeling algorithms for multi-objective uncertain shortest path problems
- A Vectorization Scheme for Nonconvex Set Optimization Problems
- Approximate elements for set optimization problems with respect to variable domination structures
- Lagrange multiplier rules for weakly minimal solutions of compact-valued set optimization problems
- On approximate solutions for nonsmooth robust multiobjective optimization problems
- Characterization of Set Relations by Means of a Nonlinear Scalarization Functional
- Strict efficiency conditions for nonsmooth optimization with inclusion constraint under Hölder directional metric subregularity
- Solving set-valued optimization problems using a multiobjective approach
- Robust efficiency and well-posedness in uncertain vector optimization problems
- Robustness for uncertain multi-objective optimization: a survey and analysis of different concepts
- Best-case scenario robust portfolio: evidence from China stock market
- Conjugate duality in set optimization via nonlinear scalarization
- Characterizations of multi-objective robustness solutions defined by Minkowski set difference
- Treatment of set-valued robustness via separation and scalarization
- On non-cooperative n-person games with set payoffs
- Approaches for biobjective integer linear robust optimization
- On two vectorization schemes for set-valued optimization
- Scalarisation-based risk concepts for robust multi-objective optimisation
- Characterization of set order relations and set optimization problems via conic scalarization
- Nonlinear conjugate gradient methods for unconstrained set optimization problems whose objective functions have finite cardinality
- Nonlinear conjugate gradient methods for optimization of set-valued maps of finite cardinality
- Optimality conditions in uncertain vector optimization problems with variable domination structures via Gerstewitz function
- Cone-compactness of a set and related topological properties: stability issues and applications
- Quasi-Newton Method for Set Optimization Problems with Set-Valued Mapping Given by Finitely Many Vector-Valued Functions
- Optimality conditions in uncertain multi-objective optimization problems with a variable domination structure
- Optimality conditions for global minimizers to a class of convex set optimization problem subjected to geometric constraints
- Sensitivity to uncertainty and scalarization in robust multiobjective optimization: an overview with application to mean-variance portfolio optimization
- A Newton method for uncertain multiobjective optimization problems with finite uncertainty sets
- A quasi-Newton method to solve uncertain multiobjective optimization problems with uncertainty set of finite cardinality
- Multi-objective minmax robust combinatorial optimization with cardinality-constrained uncertainty
- Vector-valued robust stochastic control
- On bivariate achievement scalarizing functions
- Well-posedness for the optimistic counterpart of uncertain vector optimization problems
This page was built for publication: The relationship between multi-objective robustness concepts and set-valued optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2264185)
