Optimality conditions for vector optimization problems with difference of convex maps
From MaRDI portal
The authors establish new optimality conditions for the approximate Pareto minimal points of some significant vector optimization problems with difference convex maps.
Recommendations
- On the optimality conditions for D.C. vector optimization problems
- Optimality conditions for vector optimization problems of a difference of convex mappings
- (-)efficiency in difference vector optimization
- Optimality conditions for minimizing the difference of nonconvex vector-valued mappings
- Necessary and sufficient optimality conditions for D. C. vector optimization
Cites work
- \(\epsilon\)-formality and duality for fractional programming
- -optimality conditions for composed convex optimization problems
- \(\varepsilon\)-subdifferentials of set-valued maps and \(\varepsilon\)-weak Pareto optimality for multiobjective optimization
- Gap continuity of multimaps
- Higher order optimality conditions for Henig efficient solutions in set-valued optimization
- scientific article; zbMATH DE number 16313 (Why is no real title available?)
- Lagrange multipliers for \(\varepsilon \)-Pareto solutions in vector optimization with nonsolid cones in Banach spaces
- Nonconvex vector optimization of set-valued mappings.
- On subdifferentials of set-valued maps
- On the Dini-Hadamard subdifferential of the difference of two functions
- On the subdifferentiability of the difference of two functions and local minimization
- Optimality conditions for D.C. vector optimization problems under reverse convex constraints
- Optimality conditions for set-valued optimization problems
- Optimality conditions for the difference of convex set-valued mappings
- Optimality conditions in DC-constrained optimization
- Optimization of set-valued functions
- Pareto Subdifferential Calculus for Convex Vector Mappings and Applications to Vector Optimization
- Second-order optimality conditions for strict efficiency of constrained set-valued optimization
- Simplified optimality conditions for minimizing the difference of vector-valued functions
- Subdifferentiability of Convex Functions with Values in an Ordered Vector Space.
- Sufficient optimality condition for vector optimization problems under D.C. data
- The directional subdifferential of the difference of two convex functions
Cited in
(21)- Regularity conditions in differentiable vector optimization revisited
- A note on optimality conditions for DC programs involving composite functions
- A modified proximal point method for DC functions on Hadamard manifolds
- A proximal point method for difference of convex functions in multi-objective optimization with application to group dynamic problems
- A note on the paper ``Optimality conditions for vector optimization problems with difference of convex maps
- (-)efficiency in difference vector optimization
- Bilevel optimization with a multiobjective problem in the lower level
- Some characterizations of robust optimal solutions for uncertain fractional optimization and applications
- Optimality conditions for composite DC infinite programming problems
- scientific article; zbMATH DE number 1460274 (Why is no real title available?)
- Necessary and sufficient optimality conditions for D. C. vector optimization
- On the optimality conditions for D.C. vector optimization problems
- ON OPTIMALITY CONDITIONS FOR ABSTRACT CONVEX VECTOR OPTIMIZATION PROBLEMS
- Simplified optimality conditions for minimizing the difference of vector-valued functions
- Focus on sufficient optimality conditions in D.C. vector optimization
- Optimality conditions for -weak local quasi-efficient solutions of D.C. vector optimization problems
- -weak Pareto minimality in D. C. vector optimization
- Duality principles for optimization problems dealing with the difference of vector-valued convex mappings
- Optimality conditions and DC-Dinkelbach-type algorithm for vector fractional programming problems with ratios of difference of convex functions
- Optimality conditions for minimizing the difference of nonconvex vector-valued mappings
- Optimality conditions for vector optimization problems of a difference of convex mappings
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)
