Necessary Conditions for Local Optimality in Difference-of-Convex Programming
Using ε-subdifferential calculus for difference-of-convex (d.c.) optimization, Dür proposed a condition sufficient for local optimality, and showed that this condition is not necessary in general. Here it is proved that whenever the convex part is strongly convex, this condition is also necessary. Strong convexity can...