Optimality conditions for D.C. vector optimization problems under reverse convex constraints

DOI10.1007/s10898-004-8318-4zbMath1121.90403OpenAlexW2002055553MaRDI QIDQ816065

N. E. Zubov

Publication date: 20 February 2006

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

Full work available at URL: https://doi.org/10.1007/s10898-004-8318-4

zbMATH Keywords

subdifferentialoptimality conditionconvex mappingD.C. mappingglobal weak minimal solutionreverse convex

Mathematics Subject Classification ID

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

Related Items (11)

Proximal point algorithms for multi-criteria optimization with the difference of convex objective functions ⋮ Calculus of tangent sets and derivatives of set-valued maps under metric subregularity conditions ⋮ On the optimality conditions for D.C. vector optimization problems ⋮ Subdifferential and optimality conditions for the difference of set-valued mappings ⋮ Characterizing strict efficiency for convex multiobjective programming problems ⋮ Necessary optimality conditions for vector reverse convex minimization problems via a conjugate duality ⋮ Optimality conditions for vector optimization problems with difference of convex maps ⋮ Proximal point algorithms for vector DC programming with applications to probabilistic lot sizing with service levels ⋮ Optimality conditions for minimizing the difference of nonconvex vector-valued mappings ⋮ Necessary optimality conditions of a D.C. set-valued bilevel optimization problem ⋮ Strict vector variational inequalities and strict Pareto efficiency in nonconvex vector optimization

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Semi-continuous mappings in general topology
• Duality in D. C. programming: The case of several D. C. constraints
• A characterization of proper minimal points as solutions of sublinear optimization problems
• Sufficient optimality condition for vector optimization problems under D.C. data
• Kolmogorov conditions for vectorial optimization problems
• Optimization and nonsmooth analysis
• A formula on the approximate subdifferential of the difference of convex functions
• Tangent Cones, Generalized Gradients and Mathematical Programming in Banach Spaces
• Duality in Reverse Convex Optimization
• Global Optimality Criterion and a Duality with a Zero Gap in Nonconvex Optimization
• On lagrange-kuhn-tucker multipliers for pareto optimization problems
• On Lagrance-Kuhn-Tucker Mulitipliers for Muliobjective Optimization Problems
• Duality for anticonvex programs.
• Simplified optimality conditions for minimizing the difference of vector-valued functions

This page was built for publication: Optimality conditions for D.C. vector optimization problems under reverse convex constraints