Sequential Pareto subdifferential sum rule for convex set-valued mappings and applications
From MaRDI portal
Publication:6050160
DOI10.1007/s10957-023-02255-8zbMath1522.90098OpenAlexW4382394727MaRDI QIDQ6050160
Mohamed Laghdir, El Mahjoub Echchaabaoui
Publication date: 18 September 2023
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-023-02255-8
Convex programming (90C25) 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On subdifferential calculus for set-valued mappings and optimality conditions
- On subdifferentials of set-valued maps
- Optimization of set-valued functions
- Sequential characterizations of approximate solutions in convex vector optimization problems with set-valued maps
- Sequential \(\varepsilon\)-subdifferential calculus for scalar and vector mappings
- Sequential optimality conditions for composed convex optimization problems
- Lagrange multipliers for set-valued optimization problems associated with coderivatives
- Pareto Subdifferential Calculus for Convex Vector Mappings and Applications to Vector Optimization
- Sequential Convex Subdifferential Calculus and Sequential Lagrange Multipliers
- New Sequential Lagrange Multiplier Conditions Characterizing Optimality without Constraint Qualification for Convex Programs
- Subdifferential calculus without qualification conditions, using approximate subdifferentials: A survey
- Set-valued Optimization
