Pareto-Fenchel -subdifferential composition rule and -efficiency

DOI10.1080/01630563.2013.812110zbMATH Open1286.49017OpenAlexW1974710989MaRDI QIDQ5409722FDOQ5409722

Authors: Mounir El Maghri 

Publication date: 14 April 2014

Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/01630563.2013.812110

Recommendations

• Pareto-Fenchel \({\epsilon}\)-subdifferential sum rule and \({\epsilon}\)-efficiency
• A chain rule for \(\varepsilon\)-subdifferentials with applications to approximate solutions in convex Pareto problems
• Sequential Pareto subdifferential composition rule and sequential efficiency
• \(\varepsilon\)-optimality conditions for composed convex optimization problems
• Pareto epsilon-subdifferential sum rule for set-valued mappings and applications to set optimization

zbMATH Keywords

vector optimizationapproximate efficiencyapproximate vector subdifferentialscone-inequality constraintsvector composites

Mathematics Subject Classification ID

Convex programming (90C25) Multi-objective and goal programming (90C29) Nonsmooth analysis (49J52) Optimality conditions for problems in abstract spaces (49K27)

Cites Work

• Convex Analysis
• Theory of multiobjective optimization
• Variational methods in partially ordered spaces
• Encyclopedia of Optimization
• Handbook of multicriteria analysis
• From scalar to vector optimization.
• Duality in Vector Optimization
• Conjugate maps and duality in multiobjective optimization
• \(\varepsilon\)-subdifferentials of set-valued maps and \(\varepsilon\)-weak Pareto optimality for multiobjective optimization
• Limiting \(\varepsilon\)-subgradient characterizations of constrained best approximation
• Subdifferentials of multifunctions and Lagrange multipliers for multiobjective optimization.
• Sequential Convex Subdifferential Calculus and Sequential Lagrange Multipliers
• Asymptotic conditions for weak and proper optimality in infinite dimensional convex vector optimization
• Optimization of set-valued functions
• Pareto Subdifferential Calculus for Convex Vector Mappings and Applications to Vector Optimization
• Subdifferentiability of Convex Functions with Values in an Ordered Vector Space.
• Second-order efficiency conditions and sensitivity of efficient points
• Duality for the sum of convex functions in general normed spaces
• Title not available (Why is that?)
• Pareto-Fenchel \({\epsilon}\)-subdifferential sum rule and \({\epsilon}\)-efficiency
• Pareto Optimizing and Kuhn–Tucker Stationary Sequences
• Title not available (Why is that?)

Cited In (6)

• Title not available (Why is that?)
• Pareto-Fenchel \({\epsilon}\)-subdifferential sum rule and \({\epsilon}\)-efficiency
• Chain rules for a proper \(\varepsilon\)-subdifferential of vector mappings
• A chain rule for \(\varepsilon\)-subdifferentials with applications to approximate solutions in convex Pareto problems
• Sequential \(\varepsilon\)-subdifferential calculus for scalar and vector mappings
• (\(\epsilon\)-)efficiency in difference vector optimization

This page was built for publication: Pareto-Fenchel \({\epsilon}\)-subdifferential composition rule and \({\epsilon}\)-efficiency

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5409722)