Unified robust necessary optimality conditions for nonconvex nonsmooth uncertain multiobjective optimization
From MaRDI portal
Publication:2082239
DOI10.1007/s10957-022-02075-2zbMath1503.90158OpenAlexW4295073687MaRDI QIDQ2082239
Min Feng, Jie Wang, Sheng Jie Li
Publication date: 4 October 2022
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-022-02075-2
nonconvex nonsmooth uncertain multiobjective optimization programrobust necessary optimality condition
Optimality conditions and duality in mathematical programming (90C46) Dynamic programming (90C39) Programming in abstract spaces (90C48)
Cites Work
- Minmax robustness for multi-objective optimization problems
- Some characterizations of robust optimal solutions for uncertain convex optimization problems
- Subsmooth semi-infinite and infinite optimization problems
- Dominance for multi-objective robust optimization concepts
- Characterizations of robust solution set of convex programs with uncertain data
- On nonsmooth robust multiobjective optimization under generalized convexity with applications to portfolio optimization
- A unified approach to uncertain optimization
- Subdifferential of the supremum via compactification of the index set
- Robust necessary optimality conditions for nondifferentiable complex fractional programming with uncertain data
- Optimality conditions for a nonsmooth uncertain multiobjective programming problem
- Subdifferential of the supremum function: moving back and forth between continuous and non-continuous settings
- Characterizing robust solution sets of convex programs under data uncertainty
- Radius of robust feasibility of system of convex inequalities with uncertain data
- Some characterizations of robust solution sets for uncertain convex optimization problems with locally Lipschitz inequality constraints
- Optimality conditions and duality for robust nonsmooth multiobjective optimization problems with constraints
- Theory and Applications of Robust Optimization
- Optimization and nonsmooth analysis
- Necessary optimality conditions for nonsmooth robust optimization problems
- Robust Optimality and Duality in Multiobjective Optimization Problems under Data Uncertainty
- Linear Matrix Inequality Conditions and Duality for a Class of Robust Multiobjective Convex Polynomial Programs
- ON NONSMOOTH OPTIMALITY THEOREMS FOR ROBUST OPTIMIZATION PROBLEMS
- Optimality and duality for robust multiobjective optimization problems
- Robustness for uncertain multi-objective optimization: a survey and analysis of different concepts
- Robust nonsmooth optimality conditions for multiobjective optimization problems with infinitely many uncertain constraints
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Unified robust necessary optimality conditions for nonconvex nonsmooth uncertain multiobjective optimization