A note on optimality conditions for DC programs involving composite functions
Summary: By using the formula of the \(\epsilon\)-subdifferential for the sum of a convex function with a composition of convex functions, some necessary and sufficient optimality conditions for a DC programming problem involving a composite function are obtained. As applications, a composed convex optimization problem, a DC optimization problem, and a convex optimization problem with a linear operator are examined at the end of this paper.
scientific article; zbMATH DE number 7021920
scientific article