Robustness characterizations for uncertain optimization problems via image space analysis
From MaRDI portal
Publication:2194124
DOI10.1007/s10957-020-01709-7zbMath1491.90168OpenAlexW3038937359MaRDI QIDQ2194124
Hong-Zhi Wei, Chun-Rong Chen, Sheng Jie Li
Publication date: 25 August 2020
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-020-01709-7
Multi-objective and goal programming (90C29) Nonlinear programming (90C30) Optimality conditions and duality in mathematical programming (90C46) Sensitivity, stability, parametric optimization (90C31) Robustness in mathematical programming (90C17)
Related Items (6)
Robust optimality, duality and saddle points for multiobjective fractional semi-infinite optimization with uncertain data ⋮ Image space analysis for set optimization problems with applications ⋮ Necessary optimality conditions for nonsmooth robust optimization problems ⋮ Optimality and error bound for set optimization with application to uncertain multi-objective programming ⋮ Scalarization of multiobjective robust optimization problems ⋮ Image space analysis for uncertain multiobjective optimization problems: robust optimality conditions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Nonlinear separation functions, optimality conditions and error bounds for Ky Fan quasi-inequalities
- Some characterizations of robust optimal solutions for uncertain convex optimization problems
- A unified approach for constrained extremum problems: image space analysis
- Image space analysis for variational inequalities with cone constraints and applications to traffic equilibria
- Nonconvex separation theorems and some applications in vector optimization
- Separation of sets and Wolfe duality
- Duality in robust optimization: Primal worst equals dual best
- Robust discrete optimization and its applications
- Robust solutions of linear programming problems contaminated with uncertain data
- Constrained extremum problems and image space analysis. I: Optimality conditions
- Constrained extremum problems and image space analysis. II: Duality and penalization
- Image space analysis to Lagrange-type duality for constrained vector optimization problems with applications
- Some perspectives on set-valued optimization via image space analysis
- Image space analysis for constrained inverse vector variational inequalities via multiobjective optimization
- Characterizations for optimality conditions of general robust optimization problems
- Some perspectives on vector optimization via image space analysis
- A unified characterization of multiobjective robustness via separation
- A unified approach to uncertain optimization
- Characterizing robust solution sets of convex programs under data uncertainty
- A unified approach through image space analysis to robustness in uncertain optimization problems
- Dual approaches to characterize robust optimal solution sets for a class of uncertain optimization problems
- Characterizations of multiobjective robustness via oriented distance function and image space analysis
- Constrained optimization and image space analysis. Vol. 1: Separation of sets and optimality conditions
- Nonlinear separation approach to inverse variational inequalities
- A unified approach for different concepts of robustness and stochastic programming via non-linear scalarizing functionals
- Technical Note—Deriving Robust and Globalized Robust Solutions of Uncertain Linear Programs with General Convex Uncertainty Sets
- A Scenario-Based Approach for Robust Linear Optimization
- Vector Optimization
- Theory and Applications of Robust Optimization
- Nonlinear separation in the image space with applications to penalty methods
- Tangent Cones, Generalized Gradients and Mathematical Programming in Banach Spaces
- Degrees of Efficiency and Degrees of Minimality
- Characterizations of multiobjective robustness on vectorization counterparts
- Multicriteria Optimization
- ON NONSMOOTH OPTIMALITY THEOREMS FOR ROBUST OPTIMIZATION PROBLEMS
- Set-valued Optimization
- Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
This page was built for publication: Robustness characterizations for uncertain optimization problems via image space analysis
