Faster Randomized Block Kaczmarz Algorithms

From MaRDI portal
Publication:5203967

DOI10.1137/19M1251643zbMath1453.65074arXiv1902.09946WikidataQ126663129 ScholiaQ126663129MaRDI QIDQ5203967

Ion Necoara

Publication date: 9 December 2019

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1902.09946




Related Items (40)

A Deterministic Kaczmarz Algorithm for Solving Linear SystemsAn Optimal Scheduled Learning Rate for a Randomized Kaczmarz AlgorithmGreedy randomized and maximal weighted residual Kaczmarz methods with oblique projectionStochastic block projection algorithms with extrapolation for convex feasibility problemsOn greedy randomized average block Kaczmarz method for solving large linear systemsOn block accelerations of quantile randomized Kaczmarz for corrupted systems of linear equationsOn Convergence of the Partially Randomized Extended Kaczmarz MethodOn the relaxed greedy deterministic row and column iterative methodsRandomized approximate class-specific kernel spectral regression analysis for large-scale face verificationRandomized Kaczmarz with averagingRidgeSketch: A Fast Sketching Based Solver for Large Scale Ridge RegressionA semi-randomized Kaczmarz method with simple random sampling for large-scale linear systemsAn almost-maximal residual tensor block Kaczmarz method for large tensor linear systemsOn adaptive block coordinate descent methods for ridge regressionRandomized Kaczmarz method with adaptive stepsizes for inconsistent linear systemsRandomized Block Adaptive Linear System SolversOn convergence rates of Kaczmarz-type methods with different selection rules of working rowsFaster randomized block sparse Kaczmarz by averagingA surrogate hyperplane Kaczmarz method for solving consistent linear equationsRandomized Douglas–Rachford Methods for Linear Systems: Improved Accuracy and EfficiencyFaster Deterministic Pseudoinverse-Free Block Extension of Motzkin Method for Large Consistent Linear SystemsOn pseudoinverse-free block maximum residual nonlinear Kaczmarz method for solving large-scale nonlinear system of equationsRandomized Kaczmarz algorithm with averaging and block projectionOn fast greedy block Kaczmarz methods for solving large consistent linear systemsSplitting-based randomized iterative methods for solving indefinite least squares problemRandomized block subsampling Kaczmarz-Motzkin methodAccelerating the distributed Kaczmarz algorithm by strong over-relaxationBlock sampling Kaczmarz-Motzkin methods for consistent linear systemsRandomized Extended Average Block Kaczmarz for Solving Least SquaresA doubly stochastic block Gauss-Seidel algorithm for solving linear equationsConvergence analyses based on frequency decomposition for the randomized row iterative methodOn maximum residual block and two-step Gauss-Seidel algorithms for linear least-squares problemsRandomized double and triple Kaczmarz for solving extended normal equationsMinibatch stochastic subgradient-based projection algorithms for feasibility problems with convex inequalitiesOn Adaptive Sketch-and-Project for Solving Linear SystemsConvergence and Semi-Convergence of a Class of Constrained Block Iterative MethodsGreedy Kaczmarz Algorithm Using Optimal Intermediate Projection Technique for Coherent Linear SystemsA Kaczmarz Algorithm for Solving Tree Based Distributed Systems of EquationsOn a fast deterministic block Kaczmarz method for solving large-scale linear systemsGeneralized Gearhart-Koshy acceleration for the Kaczmarz method



Cites Work


This page was built for publication: Faster Randomized Block Kaczmarz Algorithms