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

DOI10.1007/S11590-013-0681-YzbMATH Open1328.90134OpenAlexW2042138650MaRDI QIDQ742398FDOQ742398

Authors: Nan-Jing Huang, X. J. 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

Recommendations

• Optimality conditions for vector optimization problems of a difference of convex mappings
• Optimality conditions for the difference of convex set-valued mappings
• Optimality conditions for vector optimization problems with difference of convex maps
• Simplified optimality conditions for minimizing the difference of vector-valued functions
• Optimality conditions for strictly efficient solutions of nondifferentiable vector optimization problem

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)

Cites Work

• Variational Analysis
• Title not available (Why is that?)
• On difference convexity of locally Lipschitz functions
• Optimization and nonsmooth analysis
• A vector variational inequality and optimization over an efficient set
• Lipschitz properties of the scalarization function and applications
• Fuzzy necessary optimality conditions for vector optimization problems
• Metric regularity and subdifferential calculus
• Nonconvex separation theorems and some applications in vector optimization
• 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
• A closedness condition and its applications to DC programs with convex constraints
• 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
• Fréchet subdifferential calculus and optimality conditions in nondifferentiable programming
• Sufficient optimality condition for vector optimization problems under D.C. data
• Title not available (Why is that?)
• Simplified optimality conditions for minimizing the difference of vector-valued functions
• Duality for anticonvex programs.
• Optimality conditions for vector optimization problems of a difference of convex mappings
• The extremal principle and its applications to optimization and economics

Cited In (6)

• Title not available (Why is that?)
• Strict vector variational inequalities and strict Pareto efficiency in nonconvex vector optimization
• Optimality conditions for vector optimization problems with difference of convex maps
• Simplified optimality conditions for minimizing the difference of vector-valued functions
• Optimality conditions for the difference of convex set-valued mappings
• Optimality conditions for vector optimization problems of a difference of convex mappings

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

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