Pseudo-linear Convergence of an Additive Schwarz Method for Dual Total Variation Minimization

In this paper, we propose an overlapping additive Schwarz method for total variation minimization based on a dual formulation. The $O(1\mathrm{/}n)$-energy convergence of the proposed method is proven, where $n$ is the number of iterations. In addition, we introduce an interesting convergence property called pseudo-linear convergence of the proposed method; the energy of the proposed method decreases as fast as linearly convergent algorithms until it reaches a particular value. It is shown that such the particular value depends on the overlapping width $\delta$, and the proposed method becomes as efficient as linearly convergent algorithms if $\delta$ is large. As the latest domain decomposition methods for total variation minimization are sublinearly convergent, the proposed method outperforms them in the sense of the energy decay. Numerical experiments which support our theoretical results are provided.