Greedy Kaczmarz algorithm using optimal intermediate projection technique for coherent linear systems
DOI10.4208/NMTMA.OA-2021-0126OpenAlexW4220942153MaRDI QIDQ5864786FDOQ5864786
Authors: Fang Geng, Lixiao Duan, Guo-Feng Zhang 
Publication date: 8 June 2022
Published in: Numerical Mathematics: Theory, Methods and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4208/nmtma.oa-2021-0126
Recommendations
- A greedy block Kaczmarz algorithm for solving large-scale linear systems
- A new greedy Kaczmarz algorithm for the solution of very large linear systems
- scientific article; zbMATH DE number 7295865
- Two-subspace projection method for coherent overdetermined systems
- On greedy randomized block Kaczmarz method for consistent linear systems
Computational methods for sparse matrices (65F50) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Iterative numerical methods for linear systems (65F10) Orthogonalization in numerical linear algebra (65F25)
Cites Work
- The University of Florida sparse matrix collection
- A randomized Kaczmarz algorithm with exponential convergence
- Parallel coordinate descent methods for big data optimization
- Paved with good intentions: analysis of a randomized block Kaczmarz method
- Randomized iterative methods for linear systems
- Randomized extended Kaczmarz for solving least squares
- Two-subspace projection method for coherent overdetermined systems
- On greedy randomized block Kaczmarz method for consistent linear systems
- Randomized block Kaczmarz method with projection for solving least squares
- Randomized extended average block Kaczmarz for solving least squares
- Title not available (Why is that?)
- On convergence rate of the randomized Kaczmarz method
- On greedy randomized Kaczmarz method for solving large sparse linear systems
- Randomized Kaczmarz with averaging
- On relaxed greedy randomized Kaczmarz methods for solving large sparse linear systems
- A new randomized Kaczmarz based kernel canonical correlation analysis algorithm with applications to information retrieval
- A geometric probability randomized Kaczmarz method for large scale linear systems
- A sampling Kaczmarz-Motzkin algorithm for linear feasibility
- Faster randomized block Kaczmarz algorithms
- A weighted randomized Kaczmarz method for solving linear systems
- A new theoretical estimate for the convergence rate of the maximal weighted residual Kaczmarz algorithm
- On two-subspace randomized extended Kaczmarz method for solving large linear least-squares problems
- Greed Works: An Improved Analysis of Sampling Kaczmarz--Motzkin
- Stochastic gradient descent for linear systems with missing data
- Variant of Greedy Randomized Gauss-Seidel Method for Ridge Regression
Cited In (1)
Uses Software
This page was built for publication: Greedy Kaczmarz algorithm using optimal intermediate projection technique for coherent linear systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5864786)
