  We introduce an abstract algorithm that aims to find the Bregman projection
onto a closed convex set. As an application, the asymptotic behaviour of an
iterative method for finding a fixed point of a quasi Bregman nonexpansive
mapping with the fixed-point closedness property is analyzed. We also show that
our result is applicable to Bregman subgradient projectors.
