Chain rules for a proper \(\varepsilon\)-subdifferential of vector mappings
DOI10.1007/s10957-015-0763-3zbMath1327.90384MaRDI QIDQ896184
Lidia Huerga, Vicente Novo Sanjurjo, César Gutiérrez, Lionel Thibault
Publication date: 14 December 2015
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-015-0763-3
vector optimization; linear scalarization; nearly cone-subconvexlikeness; proper \(\varepsilon\)-efficiency; proper \(\varepsilon\)-subdifferential; strong \(\varepsilon\)-efficiency; strong \(\varepsilon\)-subdifferential
90C25: Convex programming
90C29: Multi-objective and goal programming
49J52: Nonsmooth analysis
90C48: Programming in abstract spaces
49K27: Optimality conditions for problems in abstract spaces
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Existence and boundedness of solutions in infinite-dimensional vector optimization problems
- Optimality conditions for approximate solutions of vector optimization problems
- Pareto-Fenchel \({\epsilon}\)-subdifferential sum rule and \({\epsilon}\)-efficiency
- Scalarization and saddle points of approximate proper solutions in nearly subconvexlike vector optimization problems
- On approximate efficiency in multiobjective programming
- Theory of multiobjective optimization
- Variational methods in partially ordered spaces
- Near-subconvexlikeness in vector optimization with set-valued functions
- Proper approximate solutions and \(\varepsilon\)-subdifferentials in vector optimization: basic properties and limit behaviour
- Vector Optimization
- ε-Optimality Conditions for Vector Optimization Problems with Set-Valued Maps
- Pareto Subdifferential Calculus for Convex Vector Mappings and Applications to Vector Optimization
- Proper Efficient Points for Maximizations with Respect to Cones
- Pareto-Fenchel ε-Subdifferential Composition Rule and ε-Efficiency
- On the Subdifferentiability of Convex Functions
- A Unified Approach and Optimality Conditions for Approximate Solutions of Vector Optimization Problems