A subspace constrained randomized Kaczmarz method for structure or external knowledge exploitation
From MaRDI portal
(Redirected from Publication:6592907)
A subspace constrained randomized Kaczmarz method for structure or external knowledge exploitation (scientific article; zbMATH DE number 7901463)
A subspace constrained randomized Kaczmarz method for structure or external knowledge exploitation (scientific article; zbMATH DE number 7901463)
Recommendations
Cites work
- A randomized Kaczmarz algorithm with exponential convergence
- A sampling Kaczmarz-Motzkin algorithm for linear feasibility
- A simple, combinatorial algorithm for solving SDD systems in nearly-linear time
- AIR tools II: algebraic iterative reconstruction methods, improved implementation
- An accelerated randomized Kaczmarz algorithm
- An improved approximation algorithm for the column subset selection problem
- Block Kaczmarz method with inequalities
- Block-iterative methods for consistent and inconsistent linear equations
- Convergence properties of the randomized extended Gauss-Seidel and Kaczmarz methods
- Distributional and \(L^q\) norm inequalities for polynomials over convex bodies in \(\mathbb{R}^n\)
- Extended randomized Kaczmarz method for sparse least squares and impulsive noise problems
- Fast approximation of matrix coherence and statistical leverage
- Fast Monte Carlo Algorithms for Matrices II: Computing a Low-Rank Approximation to a Matrix
- Fast randomized numerical rank estimation for numerically low-rank matrices
- Faster randomized block Kaczmarz algorithms
- Finding structure with randomness: probabilistic algorithms for constructing approximate matrix decompositions
- Fundamentals of Computerized Tomography
- Greed Works: An Improved Analysis of Sampling Kaczmarz--Motzkin
- High-dimensional probability. An introduction with applications in data science
- scientific article; zbMATH DE number 3027894 (Why is no real title available?)
- Kaczmarz-type inner-iteration preconditioned flexible GMRES methods for consistent linear systems
- Linear convergence of the randomized sparse Kaczmarz method
- Log-concavity and strong log-concavity: a review
- On block accelerations of quantile randomized Kaczmarz for corrupted systems of linear equations
- On block Gaussian sketching for the Kaczmarz method
- On two-subspace randomized extended Kaczmarz method for solving large linear least-squares problems
- Paved with good intentions: analysis of a randomized block Kaczmarz method
- Phase retrieval via randomized Kaczmarz: theoretical guarantees
- Quantile-based iterative methods for corrupted systems of linear equations
- Quantile-based Random Kaczmarz for corrupted linear systems of equations
- Randomized Algorithms for Matrices and Data
- Randomized block Kaczmarz method with projection for solving least squares
- Randomized extended Kaczmarz for solving least squares
- Randomized iterative methods for linear systems
- Randomized Kaczmarz Converges Along Small Singular Vectors
- Randomized Kaczmarz solver for noisy linear systems
- Randomized methods for linear constraints: convergence rates and conditioning
- Randomized Projection Methods for Linear Systems with Arbitrarily Large Sparse Corruptions
- Randomized Relaxation Methods for the Maximum Feasible Subsystem Problem
- Randomized sketch descent methods for non-separable linearly constrained optimization
- Recovery of Sparsely Corrupted Signals
- Regularized Kaczmarz Algorithms for Tensor Recovery
- Relative-Error CUR Matrix Decompositions
- Sharp Analysis of Sketch-and-Project Methods via a Connection to Randomized Singular Value Decomposition
- Small ball probabilities for linear images of high-dimensional distributions
- Stochastic gradient descent, weighted sampling, and the randomized Kaczmarz algorithm
- The complexity and approximability of finding maximum feasible subsystems of linear relations
- The mathematics of computerized tomography
- The randomized Kaczmarz method with mismatched adjoint
- Two-subspace projection method for coherent overdetermined systems
- Universality laws for randomized dimension reduction, with applications
Cited in
(5)- On block accelerations of quantile randomized Kaczmarz for corrupted systems of linear equations
- Randomized Kaczmarz methods with beyond-Krylov convergence
- Preconditioning without a preconditioner using randomized block Krylov subspace methods
- On the subsample size of quantile-based randomized Kaczmarz
- Subspace-constrained randomized coordinate descent for linear systems with good low-rank matrix approximations
This page was built for publication: A subspace constrained randomized Kaczmarz method for structure or external knowledge exploitation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6592907)
