TITLE:
A Note on the Backward-Douglas-Rachford Splitting Method for Generalized DC Programming
AUTHORS:
Xinyi Zhu, Zidan Wang
KEYWORDS:
Backward-Douglas-Rachford Splitting Method, DC Programming, Nonconvex Optimization, Step Size Result
JOURNAL NAME:
Journal of Applied Mathematics and Physics,
Vol.14 No.4,
April
23,
2026
ABSTRACT: We revisit the Backward-Douglas-Rachford algorithm proposed by Pham et al. for solving generalized DC programming problems composed of differentiable, lower semicontinuous, and convex functions. By employing the convergence analysis framework of Themelis et al., based on the lower bound of smooth functions, and under the same standard assumptions and conditions, we recharacterize the range of the step size. Compared with the result of Pham et al., we obtain a larger step size range and simplify its expression. Moreover, under this step size condition, we prove that the sequence generated by the algorithm possesses subsequential convergence.