Pareto Subdifferential Calculus for Convex Vector Mappings and Applications to Vector Optimization
From MaRDI portal
Publication:3648538
DOI10.1137/070704046zbMath1176.49023OpenAlexW2036474185MaRDI QIDQ3648538
Mounir El Maghri, Mohamed Laghdir
Publication date: 27 November 2009
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/070704046
Convex programming (90C25) Multi-objective and goal programming (90C29) Nonsmooth analysis (49J52) Optimality conditions for problems in abstract spaces (49K27)
Related Items
Calculus rules of generalized \(\epsilon\)-subdifferential for vector valued mappings and applications ⋮ Sequential \(\varepsilon\)-subdifferential calculus for scalar and vector mappings ⋮ Vector optimization w.r.t. relatively solid convex cones in real linear spaces ⋮ Sequential approximate weak optimality conditions for multiobjective fractional programming problems via sequential calculus rules for the Brøndsted-Rockafellar approximate subdifferential ⋮ Sequential Pareto subdifferential sum rule for convex set-valued mappings and applications ⋮ Pareto epsilon-subdifferential sum rule for set-valued mappings and applications to set optimization ⋮ Chain rules for a proper \(\varepsilon\)-subdifferential of vector mappings ⋮ Stability of error bounds for conic subsmooth inequalities ⋮ Ekeland variational principles for vector equilibrium problems ⋮ Optimality conditions for vector optimization problems with difference of convex maps ⋮ A unified concept of approximate and quasi efficient solutions and associated subdifferentials in multiobjective optimization ⋮ Pareto-Fenchel ε-Subdifferential Composition Rule and ε-Efficiency ⋮ Pareto-Fenchel \({\epsilon}\)-subdifferential sum rule and \({\epsilon}\)-efficiency ⋮ Unnamed Item ⋮ Unnamed Item ⋮ (\(\epsilon\)-)efficiency in difference vector optimization
This page was built for publication: Pareto Subdifferential Calculus for Convex Vector Mappings and Applications to Vector Optimization