Convergence rates for Kaczmarz-type algorithms
- 193 Downloads
In this paper, we make a theoretical analysis of the convergence rates of Kaczmarz and extended Kaczmarz projection algorithms for some of the most practically used control sequences. We first prove an at least linear convergence rate for the Kaczmarz-Tanabe and its extended version methods (the one in which a complete set of projections using row/column indices is performed in each iteration). Then, we apply the main ideas of this analysis in establishing an at least sublinear, respectively, linear convergence rate for the Kaczmarz algorithm with almost cyclic and the remotest set control strategies, and their extended versions, respectively. These results complete the existing ones related to the random selection procedures.
KeywordsKaczmarz algorithm Extended Kaczmarz algorithm Control sequences Convergence rates
Mathematics Subject Classification (2010)65F10 65F20
Unable to display preview. Download preview PDF.
The author wants to thank to the anonymous referees for their valuable comments that have much improved the first versions of the paper.
- 13.Loizou, N., Richtárik, P.: A new perspective on randomized gossip algorithms. In: Proceedings of the 4th IEEE Global conference on signal and information processing (GlobalSIP), pp. 440–444 (2016)Google Scholar
- 17.Nutini, J., et al.: Convergence rates for greedy Kaczmarz algorithms, and faster randomized Kaczmarz rules using the orthogonality graph. In: Proceedings of the Thirty-Second Conference on Uncertainty in Artificial Intelligence. AUAI Press, Corvallis (2016)Google Scholar
- 20.Popa, C.: A note on Kaczmarz algorithm with remotest set control sequence. arXiv:1702.02729v1
- 21.Popa, C.: On remotest set and random controls in Kaczmarz algorithm. arXiv:1704.04660
- 24.Popa, C.: Projection Algorithms—Classical Results and Developments. Applications to Image Reconstruction. Lambert Academic Publishing - AV Akademikerverlag GmbH & Co. KG, Saarbrücken (2012)Google Scholar
- 26.Sznader, R.: Kaczmarz algorithm revisited. https://doi.org/10.4467/2353737XCT.15.220.4425