Pareto-Fenchel \({\epsilon}\)-subdifferential sum rule and \({\epsilon}\)-efficiency
From MaRDI portal
Publication:691494
DOI10.1007/s11590-011-0301-7zbMath1280.90104OpenAlexW1975805250MaRDI QIDQ691494
Publication date: 30 November 2012
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-011-0301-7
vector optimizationapproximationPareto efficiencyconvex subdifferentialspartially preordered spacesregular subdifferentiability
Multi-objective and goal programming (90C29) Sensitivity, stability, parametric optimization (90C31)
Related Items
Sequential \(\varepsilon\)-subdifferential calculus for scalar and vector mappings ⋮ Sequential approximate weak optimality conditions for multiobjective fractional programming problems via sequential calculus rules for the Brøndsted-Rockafellar approximate subdifferential ⋮ Pareto epsilon-subdifferential sum rule for set-valued mappings and applications to set optimization ⋮ On the existence of weak efficient solutions of nonconvex vector optimization problems ⋮ Chain rules for a proper \(\varepsilon\)-subdifferential of vector mappings ⋮ Variants of the Ekeland variational principle for approximate proper solutions of vector equilibrium problems ⋮ Duality related to approximate proper solutions of vector optimization problems ⋮ \(\epsilon\)-optimality conditions of vector optimization problems with set-valued maps based on the algebraic interior in real linear spaces ⋮ A unified concept of approximate and quasi efficient solutions and associated subdifferentials in multiobjective optimization ⋮ Pareto-Fenchel ε-Subdifferential Composition Rule and ε-Efficiency ⋮ Ekeland variational principles involving set perturbations in vector equilibrium problems ⋮ Limit Behavior of Approximate Proper Solutions in Vector Optimization ⋮ (\(\epsilon\)-)efficiency in difference vector optimization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Pareto optimality, game theory and equilibria
- Theory of multiobjective optimization
- Conjugate maps and duality in multiobjective optimization
- Second-order efficiency conditions and sensitivity of efficient points
- Benson proper efficiency in the vector optimization of set-valued maps
- Optimization of set-valued functions
- Duality for the sum of convex functions in general normed spaces
- Subdifferentials of multifunctions and Lagrange multipliers for multiobjective optimization.
- \(\varepsilon\)-subdifferentials of set-valued maps and \(\varepsilon\)-weak Pareto optimality for multiobjective optimization
- Handbook of multicriteria analysis
- Ordered linear spaces
- Duality in Vector Optimization
- Encyclopedia of Optimization
- Pareto Subdifferential Calculus for Convex Vector Mappings and Applications to Vector Optimization
- An Existence Theorem in Vector Optimization
- Sequential Convex Subdifferential Calculus and Sequential Lagrange Multipliers
- Proximal Methods in Vector Optimization
- Convex Analysis
