DC Programming and DCA: Thirty Years of Developments: For f = g − h with g, h ∈ Γ₀(ℝⁿ), at x ∈ ri(dom g) ∩ ri(dom h) d-Stationarity of f Is Equivalent to Strong Criticality ∅ ≠ ∂h(x) ⊂ ∂g(x)Research Paper
DC programming is the minimization of a function that is a difference of two convex functions. The class contains every function on a compact convex set and most nonconvex models of sparse learning, clustering, combinatorial relaxations and robust optimization, and its standard method, the DC Algorithm (DCA), replaces by its affine minorant…