Pareto approximate subdifferential composition rule for cone-convex set-valued mappings and Its applications
Abstract
In this paper, we develop a composition rule for the Pareto approximate subdifferential of the convex set-valued mapping F + G • H, where F, G, and H are convex set-valued mappings with G being nondecreasing.Necessary optimality conditions for constrained convex set-valued optimization problems are considered as an application.
Fields of Study & Subjects
Optimization and Variational Analysis
Contact Mechanics and Variational Inequalities
Nonlinear Differential Equations Analysis
Publication details
- Journal / source
- Applied Set-Valued Analysis and Optimization
- Volume
- 8
- Issue
- 2
- Pages
- 167–177
- Publication date
- 17 January 2026