Asynchronous block-iterative primal-dual decomposition methods for monotone inclusions

We propose new primal-dual decomposition algorithms for solving systems of inclusions involving sums of linearly composed maximally monotone operators. The principal innovation in these algorithms is that they are block-iterative in the sense that, at each iteration, only a subset of the monotone op...

Ausführliche Beschreibung