Almost sure convergence of the Kaczmarz algorithm with random measurements

From MaRDI portal
Publication:1934652

DOI10.1007/s00041-012-9237-2zbMath1268.65042OpenAlexW1976661283MaRDI QIDQ1934652

Alexander M. Powell, Xuemei Chen

Publication date: 29 January 2013

Published in: The Journal of Fourier Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00041-012-9237-2



Related Items

Convergence Properties of the Randomized Extended Gauss--Seidel and Kaczmarz Methods, Quantile-Based Iterative Methods for Corrupted Systems of Linear Equations, Rates of convergence of randomized Kaczmarz algorithms in Hilbert spaces, Randomized Kaczmarz with averaging, A new randomized Kaczmarz based kernel canonical correlation analysis algorithm with applications to information retrieval, Block Kaczmarz method with inequalities, Sequential function approximation with noisy data, A Randomized Tensor Quadrature Method for High Dimensional Polynomial Approximation, Sequential function approximation on arbitrarily distributed point sets, A Frame Reconstruction Algorithm with Applications to Magnetic Resonance Imaging, A Sampling Kaczmarz--Motzkin Algorithm for Linear Feasibility, Rows versus Columns: Randomized Kaczmarz or Gauss--Seidel for Ridge Regression, Linear convergence of the randomized sparse Kaczmarz method, Constrained ERM Learning of Canonical Correlation Analysis: A Least Squares Perspective, Two-subspace projection method for coherent overdetermined systems, On Motzkin's method for inconsistent linear systems, Convergence of online mirror descent, The Kaczmarz algorithm, row action methods, and statistical learning algorithms, Randomized subspace actions and fusion frames, Sequential approximation of functions in Sobolev spaces using random samples, An Implicit Representation and Iterative Solution of Randomly Sketched Linear Systems, Greed Works: An Improved Analysis of Sampling Kaczmarz--Motzkin, KACZMARZ ALGORITHM AND FRAMES, Regularized Kaczmarz Algorithms for Tensor Recovery, Hildreth's algorithm with applications to soft constraints for user interface layout, A Randomized Algorithm for Multivariate Function Approximation



Cites Work