Necessary optimality conditions for nonsmooth robust optimization problems
From MaRDI portal
Recommendations
- On nonsmooth optimality theorems for robust optimization problems
- Necessary Optimality Conditions for Robust Nonsmooth Multiobjective Optimization Problems
- Unified robust necessary optimality conditions for nonconvex nonsmooth uncertain multiobjective optimization
- Robust nonsmooth optimality conditions for multiobjective optimization problems with infinitely many uncertain constraints
- Characterizations for optimality conditions of general robust optimization problems
Cites work
- A unified approach for different concepts of robustness and stochastic programming via non-linear scalarizing functionals
- A unified approach through image space analysis to robustness in uncertain optimization problems
- A unified approach to uncertain optimization
- A unified characterization of multiobjective robustness via separation
- Characterizations for optimality conditions of general robust optimization problems
- Characterizations of multiobjective robustness on vectorization counterparts
- Characterizations of multiobjective robustness via oriented distance function and image space analysis
- Characterizations of robust solution set of convex programs with uncertain data
- Characterizing robust solution sets of convex programs under data uncertainty
- Constrained extremum problems and image space analysis. I: Optimality conditions
- Constrained optimization and image space analysis. Vol. 1: Separation of sets and optimality conditions
- Dual approaches to characterize robust optimal solution sets for a class of uncertain optimization problems
- scientific article; zbMATH DE number 778126 (Why is no real title available?)
- Nonconvex separation theorems and some applications in vector optimization
- Nonlinear separation approach to constrained extremum problems
- Nonlinear separation approach to inverse variational inequalities
- On nonsmooth optimality theorems for robust optimization problems
- Optimality conditions of robust convex multiobjective optimization via -constraint scalarization and image space analysis
- Robust convex optimization
- Robust discrete optimization and its applications
- Robust optimization
- Robustness characterizations for uncertain optimization problems via image space analysis
- Some characterizations of robust optimal solutions for uncertain convex optimization problems
- Tangent Cones, Generalized Gradients and Mathematical Programming in Banach Spaces
- Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
- Technical note: Deriving robust and globalized robust solutions of uncertain linear programs with general convex uncertainty sets
- Theorems of the alternative and optimality conditions
Cited in
(17)- Characterizations for optimality conditions of general robust optimization problems
- Robust necessary optimality conditions for nondifferentiable complex fractional programming with uncertain data
- Unified robust necessary optimality conditions for nonconvex nonsmooth uncertain multiobjective optimization
- Robust optimality in constrained optimization problems with application in mechanics
- Robustness characterizations for uncertain optimization problems via image space analysis
- On optimality conditions for robust weak sharp solution in uncertain optimizations
- OPTIMALITY CONDITIONS AND DUALITY IN NONDIFFERENTIABLE ROBUST OPTIMIZATION PROBLEMS
- Optimization and robustness
- On nonsmooth optimality theorems for robust optimization problems
- Necessary and sufficient optimality conditions for some robust variational problems
- Optimality conditions in optimization under uncertainty
- The perturbation method applied to a robust optimization problem with constraint
- Robust nonsmooth optimality conditions for uncertain multiobjective programs involving stable functions
- Higher-order optimality of Benson proper efficient and weakly efficient solutions for robust vector optimization problems involving set and cone constraints
- Optimality conditions in uncertain vector optimization problems with variable domination structures via Gerstewitz function
- Higher-order optimality conditions of robust Benson proper efficient solutions in uncertain vector optimization problems
- Solution existence for a class of nonsmooth robust optimization problems
This page was built for publication: Necessary optimality conditions for nonsmooth robust optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5090284)
