The LSQR method for solving tensor least-squares problems
From MaRDI portal
Multilinear algebra, tensor calculus (15A69) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Numerical optimization and variational techniques (65K10) Computing methodologies for image processing (68U10) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)
Recommendations
- Discrete cosine transform LSQR methods for multidimensional ill-posed problems
- A proximal point like method for solving tensor least-squares problems
- Global least squares methods based on tensor form to solve a class of generalized Sylvester tensor equations
- Tensor Krylov subspace methods via the Einstein product with applications to image and video processing
- Color image and video restoration using tensor CP decomposition
Cites work
- A Multilinear Singular Value Decomposition
- Analysis of individual differences in multidimensional scaling via an \(n\)-way generalization of ``Eckart-Young decomposition
- Application of ADI Iterative Methods to the Restoration of Noisy Images
- Calculating the Singular Values and Pseudo-Inverse of a Matrix
- Deblurring Images
- Fundamental tensor operations for large-scale data analysis using tensor network formats
- Global least squares method (Gl-LSQR) for solving general linear systems with several right-hand sides
- Golub-Kahan bidiagonalization for ill-conditioned tensor equations with applications
- scientific article; zbMATH DE number 430432 (Why is no real title available?)
- scientific article; zbMATH DE number 635657 (Why is no real title available?)
- scientific article; zbMATH DE number 741107 (Why is no real title available?)
- scientific article; zbMATH DE number 1012640 (Why is no real title available?)
- Krylov subspace projection method for Sylvester tensor equation with low rank right-hand side
- LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
- Tensor Decompositions and Applications
- Tensor rank is NP-complete
Cited in
(20)- A Levenberg-Marquardt method for solving semi-symmetric tensor equations
- A proximal point like method for solving tensor least-squares problems
- Color image and video restoration using tensor CP decomposition
- Global least squares methods based on tensor form to solve a class of generalized Sylvester tensor equations
- A Lanczos-type procedure for tensors
- Fast least squares approximation using tensor products of functions and linear forms
- A tensor approximation method based on ideal minimal residual formulations for the solution of high-dimensional problems
- Solving bilinear tensor least squares problems and application to Hammerstein identification
- An efficient algorithm for solving the nonnegative tensor least squares problem
- Discrete cosine transform LSQR methods for multidimensional ill-posed problems
- Spectral computation with third-order tensors using the t-product
- Paige's algorithm for solving a class of tensor least squares problem
- An efficient iterative method for solving a class of constrained tensor least squares problem
- HOSVD-TMPE: an extrapolation method for multidimensional sequences
- Sparse least squares solutions of tensor equations
- TT-LSQR for tensor least squares problems and application to data mining
- Block iterative methods for solving multi-linear systems
- A Riemannian conjugate gradient method for solving the tensor fixed-rank least-squares problem
- Truncated LSQR for matrix least squares problems
- New gradient-based iterative-like algorithms for solving a class of Sylvester tensor equations
This page was built for publication: The LSQR method for solving tensor least-squares problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2055520)
