Necessary optimality conditions for nonsmooth robust optimization problems

DOI10.1080/02331934.2020.1836636zbMath1501.90060OpenAlexW3093599374MaRDI QIDQ5090284

Chun-Rong Chen, Hong-Zhi Wei, Sheng Jie Li

Publication date: 18 July 2022

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331934.2020.1836636

zbMATH Keywords

separationimage space analysisrobust optimality conditionscalar robust optimization

Mathematics Subject Classification ID

Nonlinear programming (90C30) Optimality conditions and duality in mathematical programming (90C46) Sensitivity, stability, parametric optimization (90C31) Robustness in mathematical programming (90C17)

Related Items (2)

Optimality conditions in optimization under uncertainty ⋮ Unified robust necessary optimality conditions for nonconvex nonsmooth uncertain multiobjective optimization

Cites Work

• Unnamed Item
• Unnamed Item
• Some characterizations of robust optimal solutions for uncertain convex optimization problems
• Nonconvex separation theorems and some applications in vector optimization
• Robust discrete optimization and its applications
• Constrained extremum problems and image space analysis. I: Optimality conditions
• Characterizations for optimality conditions of general robust optimization problems
• Characterizations of robust solution set of convex programs with uncertain data
• A unified characterization of multiobjective robustness via separation
• A unified approach to uncertain optimization
• Theorems of the alternative and optimality conditions
• Nonlinear separation approach to constrained extremum problems
• Robustness characterizations for uncertain optimization problems via image space analysis
• 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
• Robust Convex Optimization
• 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
• Tangent Cones, Generalized Gradients and Mathematical Programming in Banach Spaces
• Optimality conditions of robust convex multiobjective optimization viaε-constraint scalarization and image space analysis
• Characterizations of multiobjective robustness on vectorization counterparts
• ON NONSMOOTH OPTIMALITY THEOREMS FOR ROBUST OPTIMIZATION PROBLEMS
• Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming

This page was built for publication: Necessary optimality conditions for nonsmooth robust optimization problems