Optimality conditions for vector optimization problems with difference of convex maps

DOI10.1007/s10957-013-0327-3zbMath1307.90160MaRDI QIDQ463000

Xiao-Le Guo, Sheng Jie Li

Publication date: 23 October 2014

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10957-013-0327-3

zbMATH Keywords

vector optimization; optimality condition; Pareto minimal point

Mathematics Subject Classification ID

90C29: Multi-objective and goal programming

90C46: Optimality conditions and duality in mathematical programming

90C48: Programming in abstract spaces

Related Items

Some characterizations of robust optimal solutions for uncertain fractional optimization and applications

Cites Work

• Unnamed Item
• On the Dini-Hadamard subdifferential of the difference of two functions
• The directional subdifferential of the difference of two convex functions
• Optimality conditions for D.C. vector optimization problems under reverse convex constraints
• Optimality conditions for the difference of convex set-valued mappings
• Higher order optimality conditions for Henig efficient solutions in set-valued optimization
• \(\varepsilon\)-optimality conditions for composed convex optimization problems
• Lagrange multipliers for \(\varepsilon \)-Pareto solutions in vector optimization with nonsolid cones in Banach spaces
• Gap continuity of multimaps
• On the subdifferentiability of the difference of two functions and local minimization
• Optimality conditions in DC-constrained optimization
• On subdifferentials of set-valued maps
• Optimality conditions for set-valued optimization problems
• Optimization of set-valued functions
• Nonconvex vector optimization of set-valued mappings.
• Sufficient optimality condition for vector optimization problems under D.C. data
• \(\epsilon\)-formality and duality for fractional programming
• Second-order optimality conditions for strict efficiency of constrained set-valued optimization
• \(\varepsilon\)-subdifferentials of set-valued maps and \(\varepsilon\)-weak Pareto optimality for multiobjective optimization
• Pareto Subdifferential Calculus for Convex Vector Mappings and Applications to Vector Optimization
• Subdifferentiability of Convex Functions with Values in an Ordered Vector Space.
• Simplified optimality conditions for minimizing the difference of vector-valued functions