Convergence Rates for Greedy Kaczmarz Algorithms, and Faster Randomized Kaczmarz Rules Using the Orthogonality Graph
From MaRDI portal
Publication:6281186
arXiv1612.07838MaRDI QIDQ6281186
Issam Laradji, Alim Virani, Mark Schmidt, Hoyt A. Koepke, Behrooz Sepehry, Julie Nutini
Publication date: 22 December 2016
Computational methods for sparse matrices (65F50) Iterative numerical methods for linear systems (65F10)
This page was built for publication: Convergence Rates for Greedy Kaczmarz Algorithms, and Faster Randomized Kaczmarz Rules Using the Orthogonality Graph