The Bregman Condat–Vũ algorithms () and ()
can be viewed as applications of the Bregman proximal point algorithm
to the optimality conditions (REF ).
This interpretation extends the derivation of the Bregman PDHG algorithm
from the Bregman proximal point algorithm given in [1]}.
The idea originates with He and Yuan's interpretation of PDHG as a
“preconditioned” proximal point algorithm [2]}.
