Acceleration of randomized Kaczmarz method via the Johnson-Lindenstrauss Lemma

Numerical Algorithms

Volumn 58, Issue 2, 2011, Pages 163-177

  Eldar, Yonina C ^a   Needell, Deanna ^b  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b STANFORD UNIVERSITY   (United States)

Author keywords

Computer tomography; Kaczmarz method; Randomized Kaczmarz method; Signal processing

Indexed keywords

EID: 80052283122     PISSN: 10171398     EISSN: 15729265     Source Type: Journal    
DOI: 10.1007/s11075-011-9451-z     Document Type: Article

References (25)

1. Achlioptas, D.: Database-friendly random projections: Johnson-Lindenstrauss with binary coins. J. Comput. Syst. Sci. 66(4), 671-687 (2003) (Special issue of invited papers from PODS'01).
2. Ailon, N., Chazelle, B.: The fast johnson-lindenstrauss transform and approximate nearest neighbors. SIAM J. Comput. 39, 302-322 (2009).
3. Ailon, N., Liberty, E.: Almost optimal unrestricted fast johnson-lindenstrauss transform. Available at http://arxiv. org/abs/1005. 5513 (2010).
4. Cenker, C., Feichtinger, H. G., Mayer, M., Steier, H., Strohmer, T.: New variants of the POCS method using affine subspaces of finite codimension, with applications to irregular sampling. In: Proc. SPIE: Visual Communications and Image Processing, pp. 299-310 (1992).
5. Chan, T. F., Wan, W. L.: Analysis of projection methods for solving linear systems with multiple right-hand sides. SIAM J. Sci. Comput. 18, 1698-1721 (1997).
6. Dasgupta, D., Gupta, A.: An elementary proof of the Johnson-Lindenstrauss lemma. Tech. Report 99-006, U. C. Berkeley (1999).
7. Dasgupta, S., Gupta, A.: An elementary proof of a theorem of Johnson and Lindenstrauss. Random Struct. Algorithms 22(1), 60-65 (2003).
8. Deutsch, F., Hundal, H.: The rate of convergence for the method of alternating projections. J. Math. Anal. Appl. 205(2), 381-405 (1997).
9. 2 regression and applications. In: Proc. 17th Ann. ACM-SIAM Symp. on Discrete Algorithms, pp. 1127-1136 (2006).
10. Drineas, P., Mahoney, M. W., Muthukrishnan, S.: Relative-error CUR matrix decompositions. SIAM J. Matrix Anal. A 30, 844-881 (2008).
11. Farhat, C., Roux, F. X.: Implicit parallel processing in structural mechanics. Tech. report cu-cssc-93-26, Center for Aerospace Structures, University of Colorado, Boulder, CO (1993).
12. Galàntai, A.: On the rate of convergence of the alternating projection method in finite dimensional spaces. J. Math. Anal. Appl. 310(1), 30-44 (2005).
13. Hanke, M., Niethammer, W.: On the acceleration of Kaczmarz's method for inconsistent linear systems. Linear Algebra Appl. 130, 83-98 (1990).
14. Herman, G. T., Meyer, L. B.: Algebraic reconstruction techniques can be made computationally efficient. IEEE Trans. Med. Imag. 12(3), 600-609 (1993).
15. Hinrichs, A., Vybiral, J.: Johnson-lindenstrauss lemma for circulant matrices. Random Struct. Algor. (to appear).
16. Indyk, P., Motwani, R.: Approximate nearest neighbors: towards removing the curse of dimensionality. In: Symp. on Theory of Computing, pp. 604-613 (1998).
17. Johnson, W. B., Lindenstrauss, J.: Extensions of Lipschitz mappings into a Hilbert space. In: Conf. in Modern Analysis and Probability, pp. 189-206 (1984).
18. Kaczmarz, S.: Angenäherte Auflösung von Systemen linearer Gleichungen. Bulletin International de l'Académie Polonaise des Sciences et des Lettres. Classe des Sciences Mathématiques et Naturelles. Série A, Sciences Mathématiques 35, 335-357 (1937).
19. Natterer, F.: The Mathematics of Computerized Tomography. Wiley, New York (1986).
20. Needell, D.: Randomized Kaczmarz solver for noisy linear systems. BIT Num. Math. 50(2), 395-403 (2010).
21. Sezan, K. M., Stark, H.: Applications of convex projection theory to image recovery in tomography and related areas. In: Stark, H. (ed.) Image Recovery: Theory and Application, pp. 415-462. Academic, New York (1987).
22. Smith, C. F., Peterson, A. F., Mittra, R.: A conjugate gradient algorithm for the treatment of multiple incident electromagnetic fields. IEEE Trans. Antennas Propag. 37, 1490-1493 (1989).
23. Strohmer, T.: A levinson-galerkin algorithm for regularized trigonometric approximation. SIAM J. Sci. Comput. 22(4), 1160-1183 (2000).
24. Strohmer, T., Vershynin, R.: A randomized solver for linear systems with exponential convergence. In: RANDOM 2006 (10th International Workshop on Randomization and Computation). Lecture Notes in Computer Science, number 4110, pp. 499-507. Springer (2006).
25. Strohmer, T., Vershynin, R.: A randomized Kaczmarz algorithm with exponential convergence. J. Fourier Anal. Appl. 15, 262-278 (2009).