On sketch-and-project methods for solving tensor equations

10/15/2022
by   Ling Tang, et al.
0

We first propose the regular sketch-and-project method for solving tensor equations with respect to the popular t-product. Then, three adaptive sampling strategies and three corresponding adaptive sketch-and-project methods are derived. We prove that all the proposed methods have linear convergence in expectation. Furthermore, we investigate the Fourier domain versions and some special cases of the new methods, where the latter corresponds to some famous matrix equation methods. Finally, numerical experiments are presented to demonstrate and test the feasibility and effectiveness of the proposed methods for solving tensor equations

READ FULL TEXT
research
01/03/2022

Sketch-and-project methods for tensor linear systems

We first extend the famous sketch-and-project method and its adaptive va...
research
06/06/2023

A sketch-and-project method for solving the matrix equation AXB = C

In this paper, based on an optimization problem, a sketch-and-project me...
research
11/27/2021

Preconditioned TBiCOR and TCORS Algorithms for Solving the Sylvester Tensor Equation

In this paper, the preconditioned TBiCOR and TCORS methods are presented...
research
09/09/2019

Adaptive Sketch-and-Project Methods for Solving Linear Systems

We present new adaptive sampling rules for the sketch-and-project method...
research
09/03/2022

Generative Modeling via Tree Tensor Network States

In this paper, we present a density estimation framework based on tree t...
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
10/11/2021

Randomized Extended Kaczmarz is a Limit Point of Sketch-and-Project

The sketch-and-project (SAP) framework for solving systems of linear equ...

Please sign up or login with your details

Forgot password? Click here to reset