Subdifferential and optimality conditions for the difference of set-valued mappings
From MaRDI portal
Publication:1928537
DOI10.1007/s11117-011-0128-6zbMath1255.49029MaRDI QIDQ1928537
Kok Lay Teo, Sheng Jie Li, Xiao-Le Guo
Publication date: 3 January 2013
Published in: Positivity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11117-011-0128-6
49K40: Sensitivity, stability, well-posedness
90C29: Multi-objective and goal programming
90C31: Sensitivity, stability, parametric optimization
49J53: Set-valued and variational analysis
Related Items
On some extension theorems for set-valued mappings, A note on optimality conditions for DC programs involving composite functions
Cites Work
- Unnamed Item
- Unnamed Item
- Optimality conditions for vector optimization problems of a difference of convex mappings
- Optimality conditions for D.C. vector optimization problems under reverse convex constraints
- Optimality conditions for the difference of convex set-valued mappings
- Hahn-Banach extension theorems for multifunctions revisited
- Set-valued mapping monotonicity as characterization of D.C functions
- Conjugate duality in vector optimization
- On subdifferentials of set-valued maps
- Optimality conditions for set-valued optimization problems
- Optimization of set-valued functions
- Contingent epiderivatives and set-valued optimization
- Optimality conditions in non-convex set-valued optimization
- Sufficient optimality condition for vector optimization problems under D.C. data
- Ordered linear spaces
- A Lagrange multiplier theorem and a sandwich theorem for convex relations.
- Tangent Cones, Generalized Gradients and Mathematical Programming in Banach Spaces
- An Existence Theorem in Vector Optimization
- Weak Subdifferential of Set-Valued Mappings
- Optimality conditions for maximizations of set-valued functions
- Simplified optimality conditions for minimizing the difference of vector-valued functions
