Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions

Abstract

An alternative convergence proof of a proximal-like minimization algorithm using Bregman functions, recently proposed by Censor and Zenios, is presented. The analysis allows the establishment of a global convergence rate of the algorithm expressed in terms of function values.