Abstract
In this paper, we propose and study a diagonal inexact version of Bregman proximal methods, to solve convex optimization problems with and without constraints. The proposed method forms a unified framework for existing algorithms by providing others.
Citation
S. Kabbadj. "Theoretical Aspect of Diagonal Bregman Proximal Methods." J. Appl. Math. 2020 1 - 9, 2020. https://doi.org/10.1155/2020/3108056
