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.
No takes yet. Share an insight, caveat, or question.
Chen et al. (1993) studied this question.
Synapse has enriched 2 closely related papers on similar clinical questions. Consider them for comparative context: