On relaxed greedy randomized Kaczmarz methods for solving large sparse linear systems
From MaRDI portal
Publication:1644126
DOI10.1016/j.aml.2018.03.008OpenAlexW2790998159WikidataQ130097248 ScholiaQ130097248MaRDI QIDQ1644126
Publication date: 21 June 2018
Published in: Applied Mathematics Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.aml.2018.03.008
Computational methods for sparse matrices (65F50) Numerical mathematical programming methods (65K05) Iterative numerical methods for linear systems (65F10) Randomized algorithms (68W20)
Related Items (54)
Greedy randomized and maximal weighted residual Kaczmarz methods with oblique projection ⋮ On global randomized block Kaczmarz method for image reconstruction ⋮ On greedy randomized average block Kaczmarz method for solving large linear systems ⋮ On the Kaczmarz methods based on relaxed greedy selection for solving matrix equation \(A X B = C\) ⋮ Stable Computation of Least Squares Problems of the OGM(1,N) Model and Short-Term Traffic Flow Prediction ⋮ On Relaxed Greedy Randomized Augmented Kaczmarz Methods for Solving Large Sparse Inconsistent Linear Systems ⋮ A Fast Block Coordinate Descent Method for Solving Linear Least-Squares Problems ⋮ On Convergence of the Partially Randomized Extended Kaczmarz Method ⋮ Sampling Kaczmarz-Motzkin method for linear feasibility problems: generalization and acceleration ⋮ Randomized Kaczmarz methods for tensor complementarity problems ⋮ Quantile-Based Iterative Methods for Corrupted Systems of Linear Equations ⋮ A class of residual-based extended Kaczmarz methods for solving inconsistent linear systems ⋮ On the relaxed greedy deterministic row and column iterative methods ⋮ Adaptively sketched Bregman projection methods for linear systems ⋮ On greedy randomized block Kaczmarz method for consistent linear systems ⋮ On randomized partial block Kaczmarz method for solving huge linear algebraic systems ⋮ Randomized block Kaczmarz methods with \(k\)-means clustering for solving large linear systems ⋮ A semi-randomized Kaczmarz method with simple random sampling for large-scale linear systems ⋮ An almost-maximal residual tensor block Kaczmarz method for large tensor linear systems ⋮ On adaptive block coordinate descent methods for ridge regression ⋮ Randomized Kaczmarz iteration methods: algorithmic extensions and convergence theory ⋮ On the convergence of randomized and greedy relaxation schemes for solving nonsingular linear systems of equations ⋮ On multi-step randomized extended Kaczmarz method for solving large sparse inconsistent linear systems ⋮ On convergence rates of Kaczmarz-type methods with different selection rules of working rows ⋮ On relaxed greedy randomized coordinate descent methods for solving large linear least-squares problems ⋮ Faster Deterministic Pseudoinverse-Free Block Extension of Motzkin Method for Large Consistent Linear Systems ⋮ On multi-step greedy randomized coordinate descent method for solving large linear least-squares problems ⋮ A note on convergence rate of randomized Kaczmarz method ⋮ On fast greedy block Kaczmarz methods for solving large consistent linear systems ⋮ A new greedy Kaczmarz algorithm for the solution of very large linear systems ⋮ Randomized Extended Average Block Kaczmarz for Solving Least Squares ⋮ Kaczmarz-Type Inner-Iteration Preconditioned Flexible GMRES Methods for Consistent Linear Systems ⋮ A doubly stochastic block Gauss-Seidel algorithm for solving linear equations ⋮ A count sketch maximal weighted residual Kaczmarz method for solving highly overdetermined linear systems ⋮ A geometric probability randomized Kaczmarz method for large scale linear systems ⋮ On the error estimate of the randomized double block Kaczmarz method ⋮ A weighted randomized Kaczmarz method for solving linear systems ⋮ On maximum residual block and two-step Gauss-Seidel algorithms for linear least-squares problems ⋮ Randomized double and triple Kaczmarz for solving extended normal equations ⋮ Projected randomized Kaczmarz methods ⋮ On the generally randomized extended Gauss-Seidel method ⋮ Variant of greedy randomized Kaczmarz for ridge regression ⋮ On two-subspace randomized extended Kaczmarz method for solving large linear least-squares problems ⋮ Kaczmarz method for fuzzy linear systems ⋮ On partially randomized extended Kaczmarz method for solving large sparse overdetermined inconsistent linear systems ⋮ Kaczmarz-Type Inner-Iteration Preconditioned Flexible GMRES Methods for Consistent Linear Systems ⋮ On Adaptive Sketch-and-Project for Solving Linear Systems ⋮ On relaxed greedy randomized iterative methods for the solution of factorized linear systems ⋮ Greed Works: An Improved Analysis of Sampling Kaczmarz--Motzkin ⋮ Multi-step greedy Kaczmarz algorithms with simple random sampling for solving large linear systems ⋮ On Greedy Randomized Augmented Kaczmarz Method for Solving Large Sparse Inconsistent Linear Systems ⋮ Greedy Kaczmarz Algorithm Using Optimal Intermediate Projection Technique for Coherent Linear Systems ⋮ A Partially Greedy Randomized Extended Gauss-Seidel Method for Solving Large Linear Systems ⋮ On a fast deterministic block Kaczmarz method for solving large-scale linear systems
Uses Software
Cites Work
- Unnamed Item
- Projection methods for linear systems
- A randomized Kaczmarz algorithm with exponential convergence
- On the Meany inequality with applications to convergence analysis of several row-action iteration methods
- The university of Florida sparse matrix collection
- Convergence Properties of the Randomized Extended Gauss--Seidel and Kaczmarz Methods
- On Greedy Randomized Kaczmarz Method for Solving Large Sparse Linear Systems
This page was built for publication: On relaxed greedy randomized Kaczmarz methods for solving large sparse linear systems
