## Abstract

The definition of a Bregman function, given by Censor and Lent in 1981 on the basis of Bregman's seminal 1967 paper, was subsequently used in a plethora of research works as a tool for building sequential and inherently parallel feasibility and optimization algorithms. Solodov and Svaiter have recently shown that it is not "minimal". Some of its conditions can be derived from the others. In this note we illuminate this finding from a different perspective by presenting an alternative proof of the equivalence between the original and the simplified definitions of Bregman functions in which redundant conditions are eliminated. This implicitly shows that the seemingly different notion of Bregman functions recently introduced by Butnariu and Iusem, when transported to a proper setting in R^{n}, is equivalent to the original concept. The results established in this context are also used to resolve a problem in proximity function minimization encountered by Byrne and Censor.

Original language | English |
---|---|

Pages (from-to) | 245-254 |

Number of pages | 10 |

Journal | Journal of Convex Analysis |

Volume | 10 |

Issue number | 1 |

State | Published - 2003 |

## Keywords

- Bregman distance
- Bregman function
- Kullback-Leibler distance
- Modulus of total convexity
- Sequential consistency
- Totally convex function

## ASJC Scopus subject areas

- Analysis
- Mathematics (all)