On Remotest set and Random controls in Kaczmarz algorithm

DOI10.2478/AUOM-2018-0015MaRDI QIDQ5227883zbMATH OpenOpenAlexFDO

Authors Constantin Popa

Publication date 7 August 2019

Published in Analele Universitatii "Ovidius" Constanta - Seria Matematica (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

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

zbMATH Keywords

control sequenceKaczmarz algorithmrandom controlremotest set control

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10) Numerical solutions to overdetermined systems, pseudoinverses (65F20)

Abstract: In this paper we analyse the Kaczmarz projection algorithm with Remotest set and Random control of projection indices and provide a sufficient condition such that each projection index appears infinitely many times during the iterations.

Recommendations

• A note on Kaczmarz algorithm with remotest set control sequence
• Randomized Kaczmarz iteration methods: algorithmic extensions and convergence theory
• A note on the behavior of the randomized Kaczmarz algorithm of Strohmer and Vershynin
• A randomized Kaczmarz algorithm with exponential convergence
• On the relation between the randomized extended Kaczmarz algorithm and coordinate descent
• Extreme Points of Sets of Randomized Strategies in Constrained Optimization and Control Problems
• The randomized Kaczmarz method with a new random selection rule
• scientific article; zbMATH DE number 7708789
• On convergence rate of the randomized Kaczmarz method
• On convergence of the partially randomized extended Kaczmarz method

Cited in

(2)

• Convergence rates for Kaczmarz-type algorithms
• A note on Kaczmarz algorithm with remotest set control sequence

This page was built for publication: On Remotest set and Random controls in Kaczmarz algorithm

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