Randomized regularized extended Kaczmarz algorithms for tensor recovery

12/16/2021
by   Kui Du, et al.
0

Randomized regularized Kaczmarz algorithms have recently been proposed to solve tensor recovery models with consistent linear measurements. In this work, we propose a novel algorithm based on the randomized extended Kaczmarz algorithm (which converges linearly in expectation to the unique minimum norm least squares solution of a linear system) for tensor recovery models with inconsistent linear measurements. We prove the linear convergence in expectation of our algorithm. Numerical experiments on a tensor least squares problem and a sparse tensor recovery problem are given to illustrate the theoretical results.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/22/2022

Regularized randomized iterative algorithms for factorized linear systems

Randomized iterative algorithms for solving a factorized linear system, ...
research
12/31/2022

Randomized Kaczmarz method with adaptive stepsizes for inconsistent linear systems

We investigate the randomized Kaczmarz method that adaptively updates th...
research
06/01/2020

Randomized Kaczmarz for Tensor Linear Systems

Solving linear systems of equations is a fundamental problem in mathemat...
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...
research
02/13/2021

Regularized Kaczmarz Algorithms for Tensor Recovery

Tensor recovery has recently arisen in a lot of application fields, such...
research
07/18/2017

Solving ℓ^p-norm regularization with tensor kernels

In this paper, we discuss how a suitable family of tensor kernels can be...
research
07/20/2020

Adaptive force biasing algorithms: new convergence results and tensor approximations of the bias

A modification of the Adaptive Biasing Force method is introduced, in wh...

Please sign up or login with your details

Forgot password? Click here to reset