Sufficient optimality condition for vector optimization problems under D.C. data
From MaRDI portal
Cited in
(14)- Bundle-based descent method for nonsmooth multiobjective DC optimization with inequality constraints
- Strict vector variational inequalities and strict Pareto efficiency in nonconvex vector optimization
- Subdifferential and optimality conditions for the difference of set-valued mappings
- Optimality conditions for D.C. vector optimization problems under reverse convex constraints
- Optimality conditions for vector optimization problems with difference of convex maps
- Optimality conditions for minimizing the difference of nonconvex vector-valued mappings
- Necessary optimality conditions for vector reverse convex minimization problems via a conjugate duality
- Optimality conditions for the difference of convex set-valued mappings
- Characterizing strict efficiency for convex multiobjective programming problems
- Cone arcwise connectivity in optimization problems with difference of set-valued mappings
- Focus on sufficient optimality conditions in D.C. vector optimization
- On the optimality conditions for D.C. vector optimization problems
- scientific article; zbMATH DE number 6005913 (Why is no real title available?)
- A note on the paper ``Optimality conditions for vector optimization problems with difference of convex maps
This page was built for publication: Sufficient optimality condition for vector optimization problems under D.C. data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1424961)