Approximate solutions for robust multiobjective optimization programming in Asplund spaces

DOI10.1080/02331934.2022.2105214arXiv2205.01145OpenAlexW4288068548WikidataQ114100891 ScholiaQ114100891MaRDI QIDQ6198507

Publication date: 23 February 2024

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2205.01145

zbMATH Keywords

generalized convexity approximate solutions optimality conditions robust multiobjective optimization limiting subdifferential

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Numerical optimization and variational techniques (65K10) Optimality conditions and duality in mathematical programming (90C46) Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65) Optimality conditions (49K99)

Cites Work

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
On nonsmooth robust multiobjective optimization under generalized convexity with applications to portfolio optimization
On quasi \(\epsilon\)-solution for robust convex optimization problems
On the variational principle
Optimality conditions for robust nonsmooth multiobjective optimization problems in asplund spaces
Approximate solutions in nonsmooth and nonconvex cone constrained vector optimization
\(\epsilon\)-duality of nondifferentiable nonconvex multiobjective programming
On robust multiobjective optimization
Theory and Applications of Robust Optimization
Fréchet subdifferential calculus and optimality conditions in nondifferentiable programming
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
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: Approximate solutions for robust multiobjective optimization programming in Asplund spaces