Preasymptotic convergence of randomized Kaczmarz method. (23rd November 2017)

• Record Type: Journal Article
• Authors: Jiao, Yuling; Jin, Bangti; Lu, Xiliang
• Is Part Of: Inverse problems. Volume 33:Number 12(2017:Dec.)
• Publication Date: 2017-11-23
• Subjects: randomized Kaczmarz method -- preasymptotic convergence -- smoothness -- error estimates -- variance reduction; Inverse problems (Differential equations) -- Periodicals; 515.357
• DOI: 10.1088/1361-6420/aa8e82
• Languages: English
• ISSNs: 0266-5611

Abstract

Abstract: Kaczmarz method is one popular iterative method for solving inverse problems, especially in computed tomography. Recently, it was established that a randomized version of the method enjoys an exponential convergence for well-posed problems, and the convergence rate is determined by a variant of the condition number. In this work, we analyze the preasymptotic convergence behavior of the randomized Kaczmarz method, and show that the low-frequency error (with respect to the right singular vectors) decays faster during first iterations than the high-frequency error. Under the assumption that the initial error is smooth (e.g. sourcewise representation), the result explains the fast empirical convergence behavior, thereby shedding new insights into the excellent performance of the randomized Kaczmarz method in practice. Further, we propose a simple strategy to stabilize the asymptotic convergence of the iteration by means of variance reduction. We provide extensive numerical experiments to confirm the analysis and to elucidate the behavior of the algorithms.