Minimizing Compositions of Differences-of-Convex Functions with Smooth Mappings

Abstract

We address the so-called DC (difference-of-convex functions) composite minimization problems (or DC composite programs) whose objective function is a composition of a DC function with a continuously differentiable mapping. We first develop an algorithm named DC composite algorithm (DCCA in short) for unconstrained DC composite programs and further extend to DC composite programs with constraints of inclusion associated with a smooth mapping and a closed convex set. The convergence analysis of the proposed algorithms is investigated. Applications of DCCA for two different problems, computation of the numerical radius of a square matrix and minimization of composite energies, are presented.