Randomized Kaczmarz method with adaptive stepsizes for inconsistent linear systems

12/31/2022
by   Yun Zeng, et al.
0

We investigate the randomized Kaczmarz method that adaptively updates the stepsize using readily available information for solving inconsistent linear systems. A novel geometric interpretation is provided which shows that the proposed method can be viewed as an orthogonal projection method in some sense. We prove that this method converges linearly in expectation to the unique minimum Euclidean norm least-squares solution of the linear system. Numerical experiments are given to illustrate the theoretical results.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/16/2021

Randomized regularized extended Kaczmarz algorithms for tensor recovery

Randomized regularized Kaczmarz algorithms have recently been proposed t...
research
11/30/2022

Randomized block subsampling Kaczmarz-Motzkin method

By introducing a subsampling strategy, we propose a randomized block Kac...
research
10/07/2022

On the extended randomized multiple row method for solving linear least-squares problems

The randomized row method is a popular representative of the iterative a...
research
01/13/2020

Pseudoinverse-free randomized extended block Kaczmarz for solving least squares

Randomized iterative algorithms have recently been proposed to solve lar...
research
02/10/2020

Randomized Kaczmarz with Averaging

The randomized Kaczmarz (RK) method is an iterative method for approxima...
research
05/11/2021

Preconvergence of the randomized extended Kaczmarz method

In this paper, we analyze the convergence behavior of the randomized ext...
research
11/30/2022

Subsampling for tensor least squares: Optimization and statistical perspectives

In this paper, we investigate the random subsampling method for tensor l...

Please sign up or login with your details

Forgot password? Click here to reset