Optimality conditions for minimizing the difference of nonconvex vector-valued mappings

DOI10.1007/S11590-013-0681-YzbMath1328.90134OpenAlexW2042138650MaRDI QIDQ742398

Nan-Jing Huang, Xian-Jun Long

Publication date: 18 September 2014

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-013-0681-y

zbMATH Keywords

optimality conditionMordukhovich subdifferentialdifference of nonconvex vector-valued mappingnonconvex scalarization functionstrong subdifferentialweak minimizer

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46)

Related Items (1)

Strict vector variational inequalities and strict Pareto efficiency in nonconvex vector optimization

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the Dini-Hadamard subdifferential of the difference of two functions
• Nonconvex separation theorems and some applications in vector optimization
• The directional subdifferential of the difference of two convex functions
• Optimality conditions for vector optimization problems of a difference of convex mappings
• Optimality conditions for D.C. vector optimization problems under reverse convex constraints
• Relative Pareto minimizers for multiobjective problems: Existence and optimality conditions
• Lagrangian conditions for vector optimization in Banach spaces
• Duality in D. C. programming: The case of several D. C. constraints
• Sufficient optimality condition for vector optimization problems under D.C. data
• On difference convexity of locally Lipschitz functions
• Fréchet subdifferential calculus and optimality conditions in nondifferentiable programming
• A vector variational inequality and optimization over an efficient set
• Lipschitz properties of the scalarization function and applications
• A closedness condition and its applications to DC programs with convex constraints
• Fuzzy necessary optimality conditions for vector optimization problems
• Optimization and nonsmooth analysis
• Variational Analysis
• Metric regularity and subdifferential calculus
• Duality for anticonvex programs.
• Simplified optimality conditions for minimizing the difference of vector-valued functions

This page was built for publication: Optimality conditions for minimizing the difference of nonconvex vector-valued mappings