Pareto epsilon-subdifferential sum rule for set-valued mappings and applications to set optimization
DOI10.1007/s12215-022-00831-xzbMath1522.90123OpenAlexW4308905590MaRDI QIDQ6054076
El Mahjoub Echchaabaoui, Mohamed Laghdir
Publication date: 24 October 2023
Published in: Rendiconti del Circolo Matemàtico di Palermo. Serie II (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12215-022-00831-x
optimality conditionsscalarizationset-valued vector optimizationregular subdifferentiabilityapproximate Pareto efficiencyconvex \(\varepsilon \)-subdifferentials of set-valued
Nonconvex programming, global optimization (90C26) Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46) Programming in abstract spaces (90C48)
Cites Work
- Unnamed Item
- Unnamed Item
- Pareto-Fenchel \({\epsilon}\)-subdifferential sum rule and \({\epsilon}\)-efficiency
- Conjugate duality in vector optimization
- Optimization of set-valued functions
- Subdifferential calculus for set-valued mappings and optimality conditions for multiobjective optimization problems
- \(\varepsilon\)-subdifferentials of set-valued maps and \(\varepsilon\)-weak Pareto optimality for multiobjective optimization
- Pareto Subdifferential Calculus for Convex Vector Mappings and Applications to Vector Optimization
- Set-valued Optimization
This page was built for publication: Pareto epsilon-subdifferential sum rule for set-valued mappings and applications to set optimization
