The Bregman proximal point algorithm [1]}, [2]}, [3]}
is an algorithm for monotone inclusion problems \(0 \in F(u)\) .
The update \(u^{(k+1)}\)  in one iteration of the algorithm is defined
as the solution of the inclusion
\(\nabla \phi (u^{(k)}) - \nabla \phi (u^{(k+1)}) \in F(u^{(k+1)}),\) 
