On greedy randomized average block Kaczmarz method for solving large linear systems
From MaRDI portal
Publication:2146339
DOI10.1016/j.cam.2022.114372zbMath1489.65054OpenAlexW4224990490WikidataQ114201811 ScholiaQ114201811MaRDI QIDQ2146339
Publication date: 16 June 2022
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2022.114372
Numerical solutions to overdetermined systems, pseudoinverses (65F20) Numerical mathematical programming methods (65K05) Convex programming (90C25) Iterative numerical methods for linear systems (65F10) Linear equations (linear algebraic aspects) (15A06)
Related Items (4)
Faster randomized block sparse Kaczmarz by averaging ⋮ A surrogate hyperplane Kaczmarz method for solving consistent linear equations ⋮ Faster Deterministic Pseudoinverse-Free Block Extension of Motzkin Method for Large Consistent Linear Systems ⋮ On fast greedy block Kaczmarz methods for solving large consistent linear systems
Uses Software
Cites Work
- Unnamed Item
- Randomized block Kaczmarz method with projection for solving least squares
- Block-iterative methods for consistent and inconsistent linear equations
- A randomized Kaczmarz algorithm with exponential convergence
- On convergence rate of the randomized Kaczmarz method
- On relaxed greedy randomized Kaczmarz methods for solving large sparse linear systems
- On the Meany inequality with applications to convergence analysis of several row-action iteration methods
- On two-subspace randomized extended Kaczmarz method for solving large linear least-squares problems
- Variant of greedy randomized Kaczmarz for ridge regression
- On partially randomized extended Kaczmarz method for solving large sparse overdetermined inconsistent linear systems
- Paved with good intentions: analysis of a randomized block Kaczmarz method
- On greedy randomized block Kaczmarz method for consistent linear systems
- Randomized Extended Kaczmarz for Solving Least Squares
- The university of Florida sparse matrix collection
- IMPROVED ANALYSIS OF THE SUBSAMPLED RANDOMIZED HADAMARD TRANSFORM
- Randomized Methods for Linear Constraints: Convergence Rates and Conditioning
- Convergence Properties of the Randomized Extended Gauss--Seidel and Kaczmarz Methods
- Randomized Iterative Methods for Linear Systems
- On Greedy Randomized Kaczmarz Method for Solving Large Sparse Linear Systems
- Column Subset Selection, Matrix Factorization, and Eigenvalue Optimization
- On Greedy Randomized Augmented Kaczmarz Method for Solving Large Sparse Inconsistent Linear Systems
- On Convergence of the Partially Randomized Extended Kaczmarz Method
- Randomized Extended Average Block Kaczmarz for Solving Least Squares
- Matrix Analysis and Computations
- Faster Randomized Block Kaczmarz Algorithms
- Tight upper bounds for the convergence of the randomized extended Kaczmarz and Gauss–Seidel algorithms
- On greedy randomized coordinate descent methods for solving large linear least‐squares problems
- A Sampling Kaczmarz--Motzkin Algorithm for Linear Feasibility
- Rows versus Columns: Randomized Kaczmarz or Gauss--Seidel for Ridge Regression
This page was built for publication: On greedy randomized average block Kaczmarz method for solving large linear systems
