A note on the behavior of the randomized kaczmarz algorithm of Strohmer and Vershynin

Journal of Fourier Analysis and Applications

Volumn 15, Issue 4, 2009, Pages 431-436

  Censor, Yair ^a   Herman, Gabor T ^b   Jiang, Ming ^c  

^a UNIVERSITY OF HAIFA   (Israel)

^b City College of the City University of New York   (United States)

^c PEKING UNIVERSITY   (China)

Author keywords

Kaczmarz algorithm; Projection method; Rate of convergence

Indexed keywords

EID: 70350728610     PISSN: 10695869     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00041-009-9077-x     Document Type: Article

References (25)

1. Bauschke, H.H., Borwein, J.M.: On projection algorithms for solving convex feasibility problems. SIAM Rev. 38, 367-426 (1996).
2. Bauschke, H.H., Borwein, J.M., Lewis, A.S.: The method of cyclic projections for closed convex sets in Hilbert space. Contemp. Math. 204, 1-38 (1997).
3. Bregman, L.M.: The method of successive projections for finding a common point of convex sets. Sov. Math. Dokl. 6, 688-692 (1965).
4. Butnariu, D., Davidi, R., Herman, G.T., Kazantsev, I.G.: Stable convergence behavior under summable perturbations of a class of projection methods for convex feasibility and optimization problems. IEEE J. Sel. Top. Signal Process. 1, 540-547 (2007).
5. Byrne, C.L.: Applied Iterative Methods. A.K. Peters, Wellesley (2008).
6. Censor, Y.: Row-action methods for huge and sparse systems and their applications. SIAM Rev. 23, 444-466 (1981).
7. Censor, Y., Zenios, S.A.: Parallel Optimization: Theory, Algorithms, and Applications. Oxford University Press, New York (1997).
8. Censor, Y., Elfving, T., Herman, G.T., Nikazad, T.: On diagonally-relaxed orthogonal projection methods. SIAM J. Sci. Comput. 30, 473-504 (2008).
9. Combettes, P.L.: The convex feasibility problem in image recovery. Adv. Imaging Electron Phys. 95, 155-270 (1996).
10. Demmel, J.W.: The probability that a numerical analysis problem is difficult. Math. Comput. 50, 449-480 (1988).
11. Deutsch, F., Hundal, H.: The rate of convergence for the cyclic projections algorithm I: Angles between convex sets. J. Approx. Theory 142, 36-55 (2006).
12. Eggermont, P.P.B., Herman, G.T., Lent, A.: Iterative algorithms for large partitioned linear systems, with applications to image reconstruction. Linear Algebra Appl. 40, 37-67 (1981).
13. Gordon, R., Bender, R., Herman, G.T.: Algebraic reconstruction techniques (ART) for three-dimensional electron microscopy and x-ray photography. J. Theor. Biol. 29, 471-481 (1970).
14. Gordon, D., Mansour, R.: A geometric approach to quadratic optimization: An improved method for solving strongly underdetermined systems in CT. Inverse Probl. Sci. Eng. 15, 811-826 (2007).
15. Gubin, L., Polyak, B., Raik, E.: The method of projections for finding the common point of convex sets. USSR Comput. Math. Math. Phys. 7, 1-24 (1967).
16. Hamaker, C., Solmon, D.: The angles between the null space of X-rays. J. Math. Anal. Appl. 62, 1-23 (1978).
17. Herman, G.T.: The Fundamentals of Computerized Tomography: Image Reconstruction from Projections, 2nd edn. Springer, Berlin (2009).
18. Herman, G.T.: Algebraic reconstruction techniques in medical imaging. In: Leondes, C.T. (ed.) Medical Imaging Systems Techniques and Applications: Computational Techniques, pp. 1-42. Gordon and Breach, New York (1998).
19. Herman, G.T., Meyer, L.B.: Algebraic reconstruction techniques can be made computationally efficient. IEEE Trans. Med. Imag. 12, 600-609 (1993).
20. Jiang, M., Wang, G.: Convergence studies on iterative algorithms for image reconstruction. IEEE Trans. Med. Imag. 22, 569-579 (2003).
21. Kaczmarz, S.: Angenäherte Auflösung von Systemen linearer Gleichungen. Bull. Acad. Pol. Sci. Lett. A 35, 355-357 (1937).
22. Kayalar, S., Weinert, H.L.: Error bounds for the method of alternating projections. Math. Control Signals Syst. 1, 43-59 (1988).
23. Strohmer, T., Vershynin, R.: A randomized solver for linear systems with exponential convergence. In: Diaz, J., Jansen, K., Rolim, J.D.P., Zwick, U. (eds.) Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques. Lecture Notes in Computer Science, vol. 4110, pp. 499-507. Springer, Berlin (2006).
24. Strohmer, T., Vershynin, R.: A randomized Kaczmarz algorithm with exponential convergence. J. Fourier Anal. Appl. 15, 262-278 (2009).
25. Youla, D.C.: Mathematical theory of image restoration by the method of convex projections. In: Stark, H. (ed.) Image Recovery: Theory and Applications, pp. 29-77. Academic Press, San Diego (1987).