Paige's algorithm for solving a class of tensor least squares problem
From MaRDI portal
Publication:6093561
DOI10.1007/s10543-023-00990-yOpenAlexW4386891893MaRDI QIDQ6093561
Yong-Shen Zhang, Chun-Mei Li, Xue-Feng Duan, Qing-Wen Wang
Publication date: 9 October 2023
Published in: BIT (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10543-023-00990-y
Numerical solutions to overdetermined systems, pseudoinverses (65F20) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Eigenvalues, singular values, and eigenvectors (15A18) Multilinear algebra, tensor calculus (15A69) Numerical linear algebra (65F99)
Cites Work
- Unnamed Item
- Tensor Decompositions and Applications
- Convex constrained optimization for large-scale generalized Sylvester equations
- On the convergence properties of the projected gradient method for convex optimization
- Factorization strategies for third-order tensors
- Tensor-tensor products with invertible linear transforms
- Generalized inverses of tensors via a general product of tensors
- Krylov-type methods for tensor computations.I
- Tensor Krylov subspace methods with an invertible linear transform product applied to image processing
- Numerical study on Moore-Penrose inverse of tensors via Einstein product
- Global least squares methods based on tensor form to solve a class of generalized Sylvester tensor equations
- A projection method and Kronecker product preconditioner for solving Sylvester tensor equations
- Solving multi-linear systems with \(\mathcal {M}\)-tensors
- An eigenvalue problem for even order tensors with its applications
- Moore–Penrose inverse of tensors via Einstein product
- Solving Multilinear Systems via Tensor Inversion
- Facial Recognition Using Tensor-Tensor Decompositions
- Deblurring Images
- Generalized Cross-Validation as a Method for Choosing a Good Ridge Parameter
- Nonmonotone Spectral Projected Gradient Methods on Convex Sets
- Least squares solution of the quaternion Sylvester tensor equation
- The tensor Golub–Kahan–Tikhonov method applied to the solution of ill‐posed problems with a t‐product structure
- Computation of generalized inverses of tensors via t‐product
- A fast and efficient Newton-Shultz-type iterative method for computing inverse and Moore-Penrose inverse of tensors
- Discrete cosine transform LSQR and GMRES methods for multidimensional ill-posed problems
- An iterative algorithm to solve the generalized Sylvester tensor equations
- An optimal preconditioner for tensor equations involving Einstein product
- Further results on generalized inverses of tensors via the Einstein product
- Calculating the Singular Values and Pseudo-Inverse of a Matrix
- The conjugate gradient method in extremal problems
- Bidiagonalization of Matrices and Solution of Linear Equations
This page was built for publication: Paige's algorithm for solving a class of tensor least squares problem