Key points are not available for this paper at this time.
The difference-of-convex (DC) program is a crucial approach to nonconvex optimization problems due to its structure, which encompasses a wide ranges of practical applications. In this paper, we aim to tackle a generalized class of DC programs, where the objective function is formed by summing a possibly nonsmooth nonconvex function and a differentiable nonconvex function with Lipschitz continuous gradient, and then subtracting a nonsmooth continuous convex function. We develop a proximal splitting algorithm that utilizes proximal evaluation for the concave part and Douglas--Rachford splitting for the remaining components. The algorithm guarantees subsequential convergence to a stationary point of the problem model. Under the widely used Kurdyka--Lojasiewicz property, we establish global convergence of the full sequence of iterates and derive convergence rates for both the iterates and the objective function values, without assuming the concave part is differentiable. The performance of the proposed algorithm is tested on signal recovery problems with a nonconvex regularization term and exhibits competitive results compared to notable algorithms in the literature on both synthetic data and real-world data.
Pham et al. (Mon,) studied this question.