(\(\epsilon\)-)efficiency in difference vector optimization

DOI10.1007/S10898-014-0204-0zbMath1344.90054OpenAlexW2094427242MaRDI QIDQ2342955

Mounir El Maghri

Publication date: 30 April 2015

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-014-0204-0

zbMATH Keywords

vector optimizationefficiencyoptimality criteria\(\epsilon\)-solutionsDC objectivevector \(\epsilon\)-subdifferentials

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Multi-objective and goal programming (90C29)

Related Items (1)

Duality related to approximate proper solutions of vector optimization problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Pareto-Fenchel \({\epsilon}\)-subdifferential sum rule and \({\epsilon}\)-efficiency
• On functions representable as a difference of convex functions
• Optimality conditions for vector optimization problems of a difference of convex mappings
• Pareto optimality, game theory and equilibria
• Second-order efficiency conditions and sensitivity of efficient points
• Nonlinear multiobjective optimization
• DC programming: overview.
• Calculus rules of generalized \(\epsilon\)-subdifferential for vector valued mappings and applications
• Handbook of multicriteria analysis
• Encyclopedia of Optimization
• Pareto Subdifferential Calculus for Convex Vector Mappings and Applications to Vector Optimization
• Multicriteria Optimization
• Convex Analysis
• Convex analysis and global optimization
• Simplified optimality conditions for minimizing the difference of vector-valued functions

This page was built for publication: (\(\epsilon\)-)efficiency in difference vector optimization