Block Coordinate DC Programming and Its Application to Expectation Maximization

This paper introduces a novel block coordinate variant of the Difference of Convex Algorithm (DCA) for non-convex optimization problems with a separable structure, proving its convergence rate and demonstrating its application in developing a block coordinate Expectation Maximization (EM) algorithm.