Greedy Kaczmarz algorithm using optimal intermediate projection technique for coherent linear systems

DOI10.4208/NMTMA.OA-2021-0126MaRDI QIDQ5864786zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

greedy methodsKaczmarz algorithmlinear systemstwo-subspace

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Orthogonalization in numerical linear algebra (65F25) Computational methods for sparse matrices (65F50)

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

Cites work

• A geometric probability randomized Kaczmarz method for large scale linear systems
• A new randomized Kaczmarz based kernel canonical correlation analysis algorithm with applications to information retrieval
• A new theoretical estimate for the convergence rate of the maximal weighted residual Kaczmarz algorithm
• A randomized Kaczmarz algorithm with exponential convergence
• A sampling Kaczmarz-Motzkin algorithm for linear feasibility
• A weighted randomized Kaczmarz method for solving linear systems
• Faster randomized block Kaczmarz algorithms
• Greed Works: An Improved Analysis of Sampling Kaczmarz--Motzkin
• scientific article; zbMATH DE number 3532449 (Why is no real title available?)
• On convergence rate of the randomized Kaczmarz method
• On greedy randomized block Kaczmarz method for consistent linear systems
• On greedy randomized Kaczmarz method for solving large sparse linear systems
• On relaxed greedy randomized Kaczmarz methods for solving large sparse linear systems
• On two-subspace randomized extended Kaczmarz method for solving large linear least-squares problems
• Parallel coordinate descent methods for big data optimization
• Paved with good intentions: analysis of a randomized block Kaczmarz method
• Randomized block Kaczmarz method with projection for solving least squares
• Randomized extended average block Kaczmarz for solving least squares
• Randomized extended Kaczmarz for solving least squares
• Randomized iterative methods for linear systems
• Randomized Kaczmarz with averaging
• Stochastic gradient descent for linear systems with missing data
• The University of Florida sparse matrix collection
• Two-subspace projection method for coherent overdetermined systems
• Variant of Greedy Randomized Gauss-Seidel Method for Ridge Regression

Cited in

(1)

• A greedy block Kaczmarz algorithm for solving large-scale linear systems

Describes a project that uses

Uses Software

• SparseMatrix

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)