Robust optimality and duality for composite uncertain multiobjective optimization in Asplund spaces with its applications
From MaRDI portal
Publication:6197115
DOI10.1007/s11117-024-01032-9arXiv2211.07611MaRDI QIDQ6197115
Publication date: 16 March 2024
Published in: Positivity (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2211.07611
generalized convexityoptimality conditionsdualitylimiting subdifferentialcomposite robust multiobjective optimization
Multi-objective and goal programming (90C29) Numerical optimization and variational techniques (65K10) Optimality conditions and duality in mathematical programming (90C46) Duality theory (optimization) (49N15)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Approximate solutions of multiobjective optimization problems
- On \(\epsilon\)-solutions for convex optimization problems with uncertainty data
- Minmax robustness for multi-objective optimization problems
- Concepts of efficiency for uncertain multi-objective optimization problems based on set order relations
- Robust duality for generalized convex programming problems under data uncertainty
- Generalized \(\varepsilon \)-quasi-solutions in multiobjective optimization problems: existence results and optimality conditions
- Selected topics in robust convex optimization
- Duality in robust optimization: Primal worst equals dual best
- Variational methods in partially ordered spaces
- On nonsmooth robust multiobjective optimization under generalized convexity with applications to portfolio optimization
- On quasi \(\epsilon\)-solution for robust convex optimization problems
- On optimality conditions and duality theorems for robust semi-infinite multiobjective optimization problems
- Robust optimization-methodology and applications
- \(\varepsilon\)-optimality for multiobjective programming on a Banach space
- Optimality conditions for robust nonsmooth multiobjective optimization problems in asplund spaces
- Characterizing robust solution sets of convex programs under data uncertainty
- Optimality and duality in nonsmooth conic vector optimization
- \(\epsilon\)-duality of nondifferentiable nonconvex multiobjective programming
- Optimality conditions and duality for robust nonsmooth multiobjective optimization problems with constraints
- On robust multiobjective optimization
- Necessary optimality conditions and saddle points for approximate optimization in Banach space
- Strong Duality in Robust Convex Programming: Complete Characterizations
- Fréchet subdifferential calculus and optimality conditions in nondifferentiable programming
- Two Types of Approximate Saddle Points
- Descent methods for composite nondifferentiable optimization problems
- A simple constraint qualification in infinite dimensional programming
- First- and Second-Order Epi-Differentiability in Nonlinear Programming
- Geometry of optimality conditions and constraint qualifications: The convex case
- Robust Optimality and Duality in Multiobjective Optimization Problems under Data Uncertainty
- Nonsmooth Cone-Constrained Optimization with Applications to Semi-Infinite Programming
- On approximate solutions for nonsmooth robust multiobjective optimization problems
- ε-Pareto Optimality Conditions for Convex Multiobjective Programming via Max Function
- Subdifferentials of Nonconvex Supremum Functions and Their Applications to Semi-infinite and Infinite Programs with Lipschitzian Data
- ON NONSMOOTH OPTIMALITY THEOREMS FOR ROBUST OPTIMIZATION PROBLEMS
- Optimality and duality for robust multiobjective optimization problems
This page was built for publication: Robust optimality and duality for composite uncertain multiobjective optimization in Asplund spaces with its applications