Robust nonsmooth optimality conditions for uncertain multiobjective programs involving stable functions
DOI10.1007/S11117-024-01077-WzbMATH Open1548.65141MaRDI QIDQ6612329
Publication date: 30 September 2024
Published in: Positivity (Search for Journal in Brave)
robust efficient solutionsrobust duality theoremsrobust nonsmooth optimality conditionsuncertain nonsmooth multiobjective programmingWolfe and Mond-Weir-types dual problem
Convex programming (90C25) Multi-objective and goal programming (90C29) Numerical optimization and variational techniques (65K10) Optimality conditions and duality in mathematical programming (90C46)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Concepts of efficiency for uncertain multi-objective optimization problems based on set order relations
- Optimality and duality in vector optimization involving generalized type I functions over cones
- Robust duality for generalized convex programming problems under data uncertainty
- About contingent epiderivatives
- Selected topics in robust convex optimization
- Variational methods in partially ordered spaces
- Necessary and sufficient conditions for Pareto efficiency in robust multiobjective optimization
- On optimality conditions and duality theorems for robust semi-infinite multiobjective optimization problems
- A unified approach to uncertain optimization
- Characterizing robust solution sets of convex programs under data uncertainty
- Optimality conditions and duality for robust nonsmooth multiobjective optimization problems with constraints
- Robust multiobjective optimization \& applications in portfolio optimization
- Contingent derivatives of set-valued maps and applications to vector optimization
- Variational characterization of the contingent epiderivative
- A unified approach for different concepts of robustness and stochastic programming via non-linear scalarizing functionals
- Duality theorem and vector saddle point theorem for robust multiobjective optimization problems
- Strong Duality in Robust Convex Programming: Complete Characterizations
- Optimality Conditions for Vector Equilibrium Problems in Terms of Contingent Epiderivatives
- First order optimality conditions in vector optimization involving stable functions
- Optimization and nonsmooth analysis
- A duality theorem for non-linear programming
- On the notion of tangent cone in mathematical programming
- Necessary optimality conditions for nonsmooth robust optimization problems
- Contingent derivatives and regularization for noncoercive inverse problems
- Convex Analysis
- Robust efficiency and well-posedness in uncertain vector optimization problems
- Set-valued analysis
- Optimality and duality for robust multiobjective optimization problems
- Robust optimality conditions and duality for nonsmooth multiobjective fractional semi-infinite programming problems with uncertain data
- Robust nonsmooth optimality conditions for multiobjective optimization problems with infinitely many uncertain constraints
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)
