# Incremental tensor regularized least squares with multiple right-hand sides

@inproceedings{Cao2021IncrementalTR, title={Incremental tensor regularized least squares with multiple right-hand sides}, author={Zhengbang Cao and Pengpeng Xie}, year={2021} }

Solving linear discrete ill-posed problems for third order tensor equations based on a tensor t-product has attracted much attention. But when the data tensor is produced continuously, current algorithms are not time-saving. Here, we propose an incremental tensor regularized least squares (t-IRLS) algorithm with the t-product that incrementally computes the solution to the tensor regularized least squares (t-RLS) problem with multiple lateral slices on the right-hand side. More specifically, we…

## References

SHOWING 1-10 OF 23 REFERENCES

Incremental Regularized Least Squares for Dimensionality Reduction of Large-Scale Data

- Computer ScienceSIAM J. Sci. Comput.
- 2016

A new incremental algorithm incremental regularized least squares (IRLS) that incrementally computes the solution to the regularized most squares (RLS) problem with multiple columns on the right-hand side whenever a new sample arrives.

Tensor Arnoldi–Tikhonov and GMRES-Type Methods for Ill-Posed Problems with a t-Product Structure

- MathematicsJ. Sci. Comput.
- 2022

The t-product Arnoldi (t-Arnoldi) process is defined and applied to reduce a large-scale Tikhonov regularization problem for third order tensors to a problem of small size.

Tensor Krylov subspace methods with an invertible linear transform product applied to image processing

- MathematicsApplied Numerical Mathematics
- 2021

The tensor Golub–Kahan–Tikhonov method applied to the solution of ill‐posed problems with a t‐product structure

- MathematicsNumer. Linear Algebra Appl.
- 2022

The solution methods presented first reduce a given problem to a problem of small size by application of a few steps of tensor Golub-Kahan bidiagonalization and then regularize the reduced problem so obtained by Tikhonov’s method, resulting in fully automatic solution methods that neither require a user to choose the number of bidiagonization steps nor the regularization parameter.

An Order-p Tensor Factorization with Applications in Imaging

- Computer ScienceSIAM J. Sci. Comput.
- 2013

A third-order factorization strategy and tensor operations defined in a recent paper are extended to order-$p$ tensors and two applications in imaging are concluded, including image deblurring and video facial recognition.

Weighted tensor Golub-Kahan-Tikhonov-type methods applied to image processing using a t-product

- MathematicsArXiv
- 2021

The discrepancy principle is used to determine both the regularization parameter in Tikhonov regularization and the number of bidiagonalization steps in weighted tensor Golub-Kahan-type bidiagonization processes using the t-product.

A tensor-based dictionary learning approach to tomographic image reconstruction

- Computer Science, MathematicsArXiv
- 2015

Numerical results show that the tensor formulation leads to very sparse representations of both the training images and the reconstructions due to the ability of representing repeated features compactly in the dictionary.