Optimization and duality of cone-d.c. programming (Q1905713)

Using some generalizations of directional derivatives and subdifferentials of vector-valued functions the authors prove optimality conditions for unconstrained vector optimization problems where a so-called cone d.c. function (i.e., that function is the difference of two cone-convex functions) is involved. Moreover, Toland's duality theorem for scalar d.c. problems is proved for the vector-valued case.