A greedy block Kaczmarz algorithm for solving large-scale linear systems
From MaRDI portal
Publication:2176512
DOI10.1016/J.AML.2020.106294zbMATH Open1439.65042OpenAlexW3005887107MaRDI QIDQ2176512FDOQ2176512
Authors: Yuqi Niu, Bing Zheng 
Publication date: 4 May 2020
Published in: Applied Mathematics Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.aml.2020.106294
Recommendations
- On greedy randomized block Kaczmarz method for consistent linear systems
- A new greedy Kaczmarz algorithm for the solution of very large linear systems
- On greedy randomized Kaczmarz method for solving large sparse linear systems
- Greedy Kaczmarz algorithm using optimal intermediate projection technique for coherent linear systems
- On a fast deterministic block Kaczmarz method for solving large-scale linear systems
Cites Work
- The University of Florida sparse matrix collection
- A randomized Kaczmarz algorithm with exponential convergence
- Title not available (Why is that?)
- Randomized methods for linear constraints: convergence rates and conditioning
- Title not available (Why is that?)
- Paved with good intentions: analysis of a randomized block Kaczmarz method
- Randomized extended Kaczmarz for solving least squares
- Convergence properties of the randomized extended Gauss-Seidel and Kaczmarz methods
- Acceleration of randomized Kaczmarz method via the Johnson-Lindenstrauss lemma
- Connections between the Cimmino-method and the Kaczmarz-method for the solution of singular and regular systems of equations
- Iterative algorithms for large partitioned linear systems, with applications to image reconstruction
- Block-iterative methods for consistent and inconsistent linear equations
- Randomized block Kaczmarz method with projection for solving least squares
- An iterative procedure for the solution of constrained nonlinear equations with application to optimization problems
- On greedy randomized Kaczmarz method for solving large sparse linear systems
- Tight upper bounds for the convergence of the randomized extended Kaczmarz and Gauss–Seidel algorithms
Cited In (40)
- Choosing relaxation parameter in randomized Kaczmarz method
- Deep Neural Networks for Solving Large Linear Systems Arising from High-Dimensional Problems
- Greedy randomized sampling nonlinear Kaczmarz methods
- On randomized partial block Kaczmarz method for solving huge linear algebraic systems
- On a fast deterministic block Kaczmarz method for solving large-scale linear systems
- On Adaptive Sketch-and-Project for Solving Linear Systems
- Greedy capped nonlinear Kaczmarz methods
- On multi-step extended maximum residual Kaczmarz method for solving large inconsistent linear systems
- On greedy randomized block Kaczmarz method for consistent linear systems
- Randomized block Kaczmarz methods with \(k\)-means clustering for solving large linear systems
- On maximum residual nonlinear Kaczmarz-type algorithms for large nonlinear systems of equations
- On global randomized block Kaczmarz method for image reconstruction
- Greedy block extended Kaczmarz method for solving the least squares problems
- On pseudoinverse-free block maximum residual nonlinear Kaczmarz method for solving large-scale nonlinear system of equations
- A Deterministic Kaczmarz Algorithm for Solving Linear Systems
- On adaptive block coordinate descent methods for ridge regression
- A semi-randomized Kaczmarz method with simple random sampling for large-scale linear systems
- Greedy Motzkin–Kaczmarz methods for solving linear systems
- Accelerated sampling Kaczmarz Motzkin algorithm for the linear feasibility problem
- On greedy multi-step inertial randomized Kaczmarz method for solving linear systems
- Block-iterative algorithm with row projection for consistent linear system
- Greedy Kaczmarz algorithm using optimal intermediate projection technique for coherent linear systems
- Title not available (Why is that?)
- Randomized double and triple Kaczmarz for solving extended normal equations
- On the relaxed greedy deterministic row and column iterative methods
- A doubly stochastic block Gauss-Seidel algorithm for solving linear equations
- A quantile-based block Kaczmarz algorithm for solving large consistent linear systems
- Title not available (Why is that?)
- Kaczmarz method for fuzzy linear systems
- On the adaptive deterministic block Kaczmarz method with momentum for solving large-scale consistent linear systems
- On weighted average fast block Kaczmarz methods for solving large consistent linear systems
- A partially greedy randomized extended Gauss-Seidel method for solving large linear systems
- On fast greedy block Kaczmarz methods for solving large consistent linear systems
- A surrogate hyperplane Kaczmarz method for solving consistent linear equations
- Splitting-based randomized iterative methods for solving indefinite least squares problem
- Randomized block subsampling Kaczmarz-Motzkin method
- Faster Deterministic Pseudoinverse-Free Block Extension of Motzkin Method for Large Consistent Linear Systems
- A greedy average block sparse Kaczmarz method for sparse solutions of linear systems
- A new greedy Kaczmarz algorithm for the solution of very large linear systems
- Block sampling Kaczmarz-Motzkin methods for consistent linear systems
Uses Software
This page was built for publication: A greedy block Kaczmarz algorithm for solving large-scale linear systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2176512)
