Optimality conditions for vector optimization problems with difference of convex maps

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

Cites Work

Optimality conditions for set-valued optimization problems
Higher order optimality conditions for Henig efficient solutions in set-valued optimization
Nonconvex vector optimization of set-valued mappings.
Lagrange multipliers for \(\varepsilon \)-Pareto solutions in vector optimization with nonsolid cones in Banach spaces
On the subdifferentiability of the difference of two functions and local minimization
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
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
Gap continuity of multimaps
Optimality conditions in DC-constrained optimization
On subdifferentials of set-valued maps
Optimization of set-valued functions
Sufficient optimality condition for vector optimization problems under D.C. data
\(\epsilon\)-formality and duality for fractional programming
Pareto Subdifferential Calculus for Convex Vector Mappings and Applications to Vector Optimization
Title not available (Why is that?)
Subdifferentiability of Convex Functions with Values in an Ordered Vector Space.
Simplified optimality conditions for minimizing the difference of vector-valued functions
Optimality conditions for the difference of convex set-valued mappings
\(\varepsilon\)-optimality conditions for composed convex optimization problems

Cited In (13)

A note on optimality conditions for DC programs involving composite functions
A proximal point method for difference of convex functions in multi-objective optimization with application to group dynamic problems
ON OPTIMALITY CONDITIONS FOR ABSTRACT CONVEX VECTOR OPTIMIZATION PROBLEMS
Bilevel optimization with a multiobjective problem in the lower level
Optimality conditions for composite DC infinite programming problems
Simplified optimality conditions for minimizing the difference of vector-valued functions
Duality principles for optimization problems dealing with the difference of vector-valued convex mappings
Some characterizations of robust optimal solutions for uncertain fractional optimization and applications
Focus on sufficient optimality conditions in D.C. vector optimization
On the optimality conditions for D.C. vector optimization problems
Regularity conditions in differentiable vector optimization revisited
A modified proximal point method for DC functions on Hadamard manifolds
A note on the paper ``Optimality conditions for vector optimization problems with difference of convex maps

This page was built for publication: Optimality conditions for vector optimization problems with difference of convex maps

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