Robust nonsmooth optimality conditions for uncertain multiobjective programs involving stable functions
From MaRDI portal
Recommendations
- Optimality conditions for a nonsmooth uncertain multiobjective programming problem
- Optimality conditions and duality for robust nonsmooth multiobjective optimization problems with constraints
- Optimality conditions for generalized convex nonsmooth uncertain multi-objective fractional programming
- Robust nonsmooth optimality conditions for multiobjective optimization problems with infinitely many uncertain constraints
- Robust optimality conditions and duality for nonsmooth multiobjective fractional semi-infinite programming problems with uncertain data
Cites work
- A duality theorem for non-linear programming
- A unified approach for different concepts of robustness and stochastic programming via non-linear scalarizing functionals
- A unified approach to uncertain optimization
- About contingent epiderivatives
- Characterizing robust solution sets of convex programs under data uncertainty
- Concepts of efficiency for uncertain multi-objective optimization problems based on set order relations
- Contingent derivatives and regularization for noncoercive inverse problems
- Contingent derivatives of set-valued maps and applications to vector optimization
- Convex Analysis
- Duality theorem and vector saddle point theorem for robust multiobjective optimization problems
- First order optimality conditions in vector optimization involving stable functions
- scientific article; zbMATH DE number 6541193 (Why is no real title available?)
- Necessary and sufficient conditions for Pareto efficiency in robust multiobjective optimization
- Necessary optimality conditions for nonsmooth robust optimization problems
- On optimality conditions and duality theorems for robust semi-infinite multiobjective optimization problems
- On the notion of tangent cone in mathematical programming
- Optimality and duality for robust multiobjective optimization problems
- Optimality and duality in vector optimization involving generalized type I functions over cones
- Optimality conditions and duality for robust nonsmooth multiobjective optimization problems with constraints
- Optimality Conditions for Vector Equilibrium Problems in Terms of Contingent Epiderivatives
- Optimization and nonsmooth analysis
- Robust duality for generalized convex programming problems under data uncertainty
- Robust efficiency and well-posedness in uncertain vector optimization problems
- Robust multiobjective optimization \& applications in portfolio optimization
- Robust nonsmooth optimality conditions for multiobjective optimization problems with infinitely many uncertain constraints
- Robust optimality conditions and duality for nonsmooth multiobjective fractional semi-infinite programming problems with uncertain data
- Robust optimization
- Selected topics in robust convex optimization
- Set-valued analysis
- Strong duality in robust convex programming: complete characterizations
- Variational characterization of the contingent epiderivative
- Variational methods in partially ordered spaces
Cited in
(3)- Optimality conditions for generalized convex nonsmooth uncertain multi-objective fractional programming
- Robust optimality conditions for multiobjective programming problems under data uncertainty and its applications
- A new approach for the -quasi solution of nonsmooth semi-infinite optimization problems under data uncertainty
This page was built for publication: Robust nonsmooth optimality conditions for uncertain multiobjective programs involving stable functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6612329)
