On the nature of Bregman functions - Intelligence Artificielle Access content directly
Preprints, Working Papers, ... Year : 2023

On the nature of Bregman functions


Let C be convex, compact, with nonempty interior and h be Legendre with domain C, continuous on C. We prove that h is Bregman if and only if it is strictly convex on C and C is a polytope. This provides insights on sequential convergence of many Bregman divergence based algorithm: abstract compatibility conditions between Bregman and Euclidean topology may equivalently be replaced by explicit conditions on h and C. This also emphasizes that a general convergence theory for these methods (beyond polyhedral domains) would require more refinements than Bregman's conditions.
Fichier principal
Vignette du fichier
bregmanPolytopeDomain.pdf (263.29 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03974132 , version 1 (05-02-2023)


  • HAL Id : hal-03974132 , version 1


Edouard Pauwels. On the nature of Bregman functions. 2023. ⟨hal-03974132⟩
36 View
48 Download


Gmail Facebook Twitter LinkedIn More