The Chambolle-Pock algorithm is a powerful method for solving optimization problems that involve a combination of convex functions and Bregman distances. It is particularly useful for problems that can be framed as finding a minimizer of a convex function subject to certain constraints.
Articles by others on the same topic
For a saddle point problem , one update ordering isThe proximal operators treat both nonsmooth convex terms, while the extrapolation couples the primal and dual variables. The primal objective is , with the convex conjugate. A dual-first ordering is obtained by exchanging roles; consistent indexing is needed when comparing the formulas.