Randomized Kaczmarz methods with beyond-Krylov convergence
From MaRDI portal
Cites work
- A randomized Kaczmarz algorithm with exponential convergence
- A subspace constrained randomized Kaczmarz method for structure or external knowledge exploitation
- Approximate solution of systems of linear equations†
- Blendenpik: Supercharging LAPACK's Least-Squares Solver
- Block-iterative methods for consistent and inconsistent linear equations
- Determinantal point processes in randomized numerical linear algebra
- Faster kernel ridge regression using sketching and preconditioning
- Fine-grained analysis and faster algorithms for iteratively solving linear systems
- Gaussian processes for machine learning.
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- Hessian averaging in stochastic Newton methods achieves superlinear convergence
- Improved analysis of the subsampled randomized Hadamard transform
- Iterative algorithms for large partitioned linear systems, with applications to image reconstruction
- Low rank approximation and regression in input sparsity time
- LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
- LSRN: A parallel iterative solver for strongly over- or underdetermined systems
- Methods of conjugate gradients for solving linear systems
- Numerical Optimization
- On block Gaussian sketching for the Kaczmarz method
- On the rate of convergence of the preconditioned conjugate gradient method
- Paved with good intentions: analysis of a randomized block Kaczmarz method
- Randomized Block Adaptive Linear System Solvers
- Randomized iterative methods for linear systems
- Randomized Kaczmarz with geometrically smoothed momentum
- Randomized Kaczmarz with tail averaging
- Randomized numerical linear algebra: Foundations and algorithms
- Randomized Nyström Preconditioning
- Randomized sparse block Kaczmarz as randomized dual block-coordinate descent
- Rows versus Columns: Randomized Kaczmarz or Gauss--Seidel for Ridge Regression
- Scikit-learn: machine learning in Python
- Sharp Analysis of Sketch-and-Project Methods via a Connection to Randomized Singular Value Decomposition
- The fast Johnson-Lindenstrauss transform and approximate nearest neighbors
- The mathematics of computerized tomography
Cited in
(5)- Deterministic and randomized Kaczmarz methods for AXB=C with applications to color image restoration
- A unified convergence analysis of random sketch methods for rank deficient linear systems
- Randomly sparsified Richardson iteration: a dimension-independent sparse linear solver
- Preconditioning without a preconditioner using randomized block Krylov subspace methods
- Subspace-constrained randomized coordinate descent for linear systems with good low-rank matrix approximations
This page was built for publication: Randomized Kaczmarz methods with beyond-Krylov convergence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6881035)
