Two-subspace projection method for coherent overdetermined systems
From MaRDI portal
Publication:485132
DOI10.1007/s00041-012-9248-zzbMath1306.65190arXiv1204.0277OpenAlexW2121485651MaRDI QIDQ485132
Publication date: 9 January 2015
Published in: The Journal of Fourier Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1204.0277
algorithmnumerical examplescomputer tomographyexponential convergencesignal processingKaczmarz methodoverdetermined systems of linear equationsprojection onto convex setsrandomized Kaczmarz method
Related Items
A two-step randomized Gauss-Seidel method for solving large-scale linear least squares problems, Greedy randomized and maximal weighted residual Kaczmarz methods with oblique projection, Convergence Properties of the Randomized Extended Gauss--Seidel and Kaczmarz Methods, On block accelerations of quantile randomized Kaczmarz for corrupted systems of linear equations, Solving systems of phaseless equations via Kaczmarz methods: a proof of concept study, Randomized Kaczmarz with averaging, Approximate Solutions of Linear Systems at a Universal Rate, Randomized Kaczmarz method with adaptive stepsizes for inconsistent linear systems, Sharp Analysis of Sketch-and-Project Methods via a Connection to Randomized Singular Value Decomposition, Batched Stochastic Gradient Descent with Weighted Sampling, Paved with good intentions: analysis of a randomized block Kaczmarz method, The randomized Kaczmarz algorithm with the probability distribution depending on the angle, A Sampling Kaczmarz--Motzkin Algorithm for Linear Feasibility, Rows versus Columns: Randomized Kaczmarz or Gauss--Seidel for Ridge Regression, On block Gaussian sketching for the Kaczmarz method, Two-subspace projection method for coherent overdetermined systems, Randomized block Kaczmarz method with projection for solving least squares, A refinement of an iterative orthogonal projection method, Stochastic gradient descent, weighted sampling, and the randomized Kaczmarz algorithm, Randomized subspace actions and fusion frames, On the error estimate of the randomized double block Kaczmarz method, A weighted randomized Kaczmarz method for solving linear systems, On maximum residual block and two-step Gauss-Seidel algorithms for linear least-squares problems, On the regularization effect of stochastic gradient descent applied to least-squares, Gauss-Seidel method with oblique direction, On two-subspace randomized extended Kaczmarz method for solving large linear least-squares problems, Surrounding the solution of a linear system of equations from all sides, Kaczmarz method with oblique projection, Greedy Kaczmarz Algorithm Using Optimal Intermediate Projection Technique for Coherent Linear Systems
Cites Work
- Unnamed Item
- Two-subspace projection method for coherent overdetermined systems
- Faster least squares approximation
- Semi-convergence and relaxation parameters for a class of SIRT algorithms
- On the acceleration of Kaczmarz's method for inconsistent linear systems
- Randomized Kaczmarz solver for noisy linear systems
- A randomized Kaczmarz algorithm with exponential convergence
- Strong underrelaxation in Kaczmarz's method for inconsistent systems
- The rate of convergence for the method of alternating projections. II
- Almost sure convergence of the Kaczmarz algorithm with random measurements
- Paved with good intentions: analysis of a randomized block Kaczmarz method
- On the rate of convergence of the alternating projection method in finite dimensional spaces
- Randomized Methods for Linear Constraints: Convergence Rates and Conditioning
- A Randomized Solver for Linear Systems with Exponential Convergence
