Optimality conditions of robust convex multiobjective optimization viaε-constraint scalarization and image space analysis
From MaRDI portal
Publication:5121765
DOI10.1080/02331934.2019.1658760zbMath1469.90098OpenAlexW2970618344MaRDI QIDQ5121765
Yibing Lv, La Huang, Ching-Feng Wen, Jia-wei Chen
Publication date: 19 September 2020
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2019.1658760
conjugate functionimage space analysisrobust optimality conditions\(\epsilon\)-constraint scalarization methoduncertain convex multiobjective optimization
Convex programming (90C25) Multi-objective and goal programming (90C29) Robustness in mathematical programming (90C17)
Related Items
Necessary optimality conditions for nonsmooth robust optimization problems, Characterizations of multi-objective robustness solutions defined by Minkowski set difference, Unnamed Item
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Minmax robustness for multi-objective optimization problems
- Image space analysis for variational inequalities with cone constraints and applications to traffic equilibria
- Robust optimization model for uncertain multiobjective linear programs
- Regularity conditions for constrained extremum problems via image space
- Asymptotic dual conditions characterizing optimality for infinite convex programs
- Constrained extremum problems, regularity conditions and image space analysis. I: The scalar finite-dimensional case
- Characterizations of robust solution set of convex programs with uncertain data
- On optimality conditions and duality theorems for robust semi-infinite multiobjective optimization problems
- A unified characterization of multiobjective robustness via separation
- Separations and optimality of constrained multiobjective optimization via improvement sets
- A unified approach to uncertain optimization
- Theorems of the alternative and optimality conditions
- Robust optimization-methodology and applications
- Optimality conditions and duality for robust nonsmooth multiobjective optimization problems with constraints
- Characterizations of multiobjective robustness via oriented distance function and image space analysis
- On robust multiobjective optimization
- Constrained optimization and image space analysis. Vol. 1: Separation of sets and optimality conditions
- Characterizations of solution sets of convex vector minimization problems
- Robust multiobjective optimization \& applications in portfolio optimization
- Robust Convex Optimization
- A unified approach for different concepts of robustness and stochastic programming via non-linear scalarizing functionals
- Strong Duality in Robust Convex Programming: Complete Characterizations
- Constraint Qualifications for Convex Inequality Systems with Applications in Constrained Optimization
- New Sequential Lagrange Multiplier Conditions Characterizing Optimality without Constraint Qualification for Convex Programs
- Characterizations of set relations with respect to variable domination structures via oriented distance function
- Multicriteria Optimization
- Set-valued Optimization
- Convex Analysis
- On a Bicriterion Formulation of the Problems of Integrated System Identification and System Optimization
- Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
- Robustness for uncertain multi-objective optimization: a survey and analysis of different concepts
