Theoretical Aspect of Diagonal Bregman Proximal Methods

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.