Block-projections algorithms with blocks containing mutually orthogonal rows and columns

DOI10.1023/A:1022398014630MaRDI QIDQ1293250zbMATH OpenOpenAlexFDO

Authors Constantin Popa

Publication date 28 June 1999

Published in BIT (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1022398014630

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Numerical solutions to overdetermined systems, pseudoinverses (65F20)

Cited in

(9)

• Quantile-based iterative methods for corrupted systems of linear equations
• On the Meany inequality with applications to convergence analysis of several row-action iteration methods
• Stochastic gradient descent, weighted sampling, and the randomized Kaczmarz algorithm
• On spectral properties and fast initial convergence of the Kaczmarz method
• Randomized block Kaczmarz method with projection for solving least squares
• Randomized Kaczmarz methods for t-product tensor linear systems with factorized operators
• On block accelerations of quantile randomized Kaczmarz for corrupted systems of linear equations
• Block Kaczmarz method with inequalities
• Paved with good intentions: analysis of a randomized block Kaczmarz method

This page was built for publication: Block-projections algorithms with blocks containing mutually orthogonal rows and columns

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1293250)