Robustness characterizations for uncertain optimization problems via image space analysis
From MaRDI portal
Publication:2194124
DOI10.1007/S10957-020-01709-7zbMATH Open1491.90168OpenAlexW3038937359MaRDI QIDQ2194124FDOQ2194124
Authors: Hong-Zhi Wei, C. R. Chen, S. J. 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
Recommendations
- Characterizations of robust optimality conditions via image space analysis
- Necessary optimality conditions for nonsmooth robust optimization problems
- Characterizations for optimality conditions of general robust optimization problems
- A unified approach through image space analysis to robustness in uncertain optimization problems
- Image space analysis for uncertain multiobjective optimization problems: robust optimality conditions
Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46) Nonlinear programming (90C30) Sensitivity, stability, parametric optimization (90C31) Robustness in mathematical programming (90C17)
Cites Work
- Constrained optimization and image space analysis. Vol. 1: Separation of sets and optimality conditions
- Theory and applications of robust optimization
- Robust optimization
- Multicriteria Optimization
- 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
- A unified approach for different concepts of robustness and stochastic programming via non-linear scalarizing functionals
- Vector Optimization
- A unified approach for constrained extremum problems: image space analysis
- Title not available (Why is that?)
- Title not available (Why is that?)
- Tangent Cones, Generalized Gradients and Mathematical Programming in Banach Spaces
- Degrees of Efficiency and Degrees of Minimality
- Set-valued optimization. An introduction with applications
- Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
- Nonconvex separation theorems and some applications in vector optimization
- Nonlinear separation functions, optimality conditions and error bounds for Ky Fan quasi-inequalities
- Nonlinear separation in the image space with applications to penalty methods
- Image space analysis for variational inequalities with cone constraints and applications to traffic equilibria
- Separation of sets and Wolfe duality
- Constrained extremum problems and image space analysis. I: Optimality conditions
- Some perspectives on set-valued optimization via image space analysis
- A scenario-based approach for robust linear optimization
- Characterizing robust solution sets of convex programs under data uncertainty
- Some characterizations of robust optimal solutions for uncertain convex optimization problems
- On nonsmooth optimality theorems for robust optimization problems
- Image space analysis to Lagrange-type duality for constrained vector optimization problems with applications
- Image space analysis for constrained inverse vector variational inequalities via multiobjective optimization
- Technical note: Deriving robust and globalized robust solutions of uncertain linear programs with general convex uncertainty sets
- 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
- Nonlinear separation approach to inverse variational inequalities
- Constrained extremum problems and image space analysis. II: Duality and penalization
- A unified approach to uncertain 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 through image space analysis to robustness in uncertain optimization problems
- Characterizations of multiobjective robustness on vectorization counterparts
Cited In (11)
- Characterizations of multiobjective robustness on vectorization counterparts
- A unified approach through image space analysis to robustness in uncertain optimization problems
- Characterizations of multiobjective robustness via oriented distance function and image space analysis
- Robust optimality, duality and saddle points for multiobjective fractional semi-infinite optimization with uncertain data
- Necessary optimality conditions for nonsmooth robust optimization problems
- Characterizations for optimality conditions of general robust optimization problems
- Image space analysis for set optimization problems with applications
- Image space analysis for uncertain multiobjective optimization problems: robust optimality conditions
- Optimality and error bound for set optimization with application to uncertain multi-objective programming
- Scalarization of multiobjective robust optimization problems
- Characterizations of robust optimality conditions via image space analysis
This page was built for publication: Robustness characterizations for uncertain optimization problems via image space analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2194124)
