Advanced search
Publication Cover
International Journal of Computer Mathematics Volume 92, 2015 - Issue 7
Submit an article Journal homepage
265
Views
0
CrossRef citations to date
0
Altmetric
Section B

An accelerated randomized Kaczmarz method via low-rank approximation

Xu XiangThe State Key Laboratory for High Performance Computation, National University of Defense and Technology, Changsha, Hunan410073, ChinaCorrespondence[email protected]
&
Lizhi ChengThe State Key Laboratory for High Performance Computation, National University of Defense and Technology, Changsha, Hunan410073, China
Pages 1413-1421 | Received 04 Mar 2014, Accepted 01 Jul 2014, Published online: 05 Aug 2014

References

  • C. Cenker, H.G. Feichtinger, M. Mayer, H. Steier, and T. Strohmer, New variants of the POCS Method Using Affine Subspaces of Finite Codimension, with Applications to Irregular Sampling. Proceeding of the SPIE: Visual Communications and Image Processing, Boston, MA, 1992, pp. 299–310.
  • P. Drineas, M.W. Mahoney, and S. Muthukrishnan, Sampling Algorithms for L2 Regression and Applications. Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms, Philadelphia, PA, 2006, pp. 1127–1136.
  • Y.c. Eldar and D. Needell, Acceleration of randomized Kaczmarz method via the Johnson–Lindenstrauss lemma. Numer. Algorithms 58(2) (2011), pp. 163–177. doi: 10.1007/s11075-011-9451-z
  • N.P. Halko, P.G. Martinsson, and J.A. Tropp, Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions, SIAM Rev. 53 (2011), pp. 217–288. doi: 10.1137/090771806
  • W.B. Johnson and J. Lindenstrauss, Extensions of Lipschitz mappings into a Hilbert space, Contemp. Math. 26 (1984), pp. 189–206. doi: 10.1090/conm/026/737400
  • S. Kaczmarz, Angenäherte auflösung von systemen linearer gleichungen. Bull. Int. Acad. Polon. Sci. Lett. A 35 (1937), pp. 335–357.
  • D. Needell, Randomized Kaczmarz solver for noisy linear system. BIT Numer. Math. 50 (2010), pp. 395–403. doi: 10.1007/s10543-010-0265-5
  • D. Needell, N. Srebro, and R. Ward, Stochastic gradient descent and the randomized Kaczmarz algorithm. Cite as: arXiv:1310.5715, (2013).
  • K.M. Sezan and H. Stark, Applications of convex projection theory to image recovery in tomography and related areas, in Image Recovery: Theory and Application, H. Stark ed., Academic Press, Orlando, 1987, pp. 415–462.
  • T. Strohmer and R. Vershynin, A randomized solver for linear systems with exponential convergence, in RANDOM 2006 (10th International Workshop on Randomization and Computation), number 4110 in Lecture Notes in Computer Science, Springer, Heidelberg, 2006, pp. 499–507.
  • T. Strohmer and R. Vershynin, A randomized Kaczmarz algorithm with exponential convergence. J. Fourier Anal. Appl. 15 (2009), pp. 262–278. doi: 10.1007/s00041-008-9030-4

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.