Fast randomized tensor singular value thresholding for low‐rank tensor optimization
From MaRDI portal
Recommendations
- Low tubal rank tensor completion based on singular value factors
- A randomized tensor singular value decomposition based on the t-product.
- Tensor completion and low-\(n\)-rank tensor recovery via convex optimization
- A randomized algorithm for tensor singular value decomposition using an arbitrary number of passes
- An inexact continuation accelerated proximal gradient algorithm for low \textit{n}-rank tensor recovery
Cited in
(15)- Fast low-rank modifications of the thin singular value decomposition
- A fixed point iterative method for third-order tensor linear complementarity problems
- Characterizations and perturbations of the core-EP inverse of tensors based on the T-product
- Iterative hard thresholding for low CP-rank tensor models
- The Moore-Penrose inverse of tensors via the M-product
- An efficient randomized fixed-precision algorithm for tensor singular value decomposition
- Random Double Tensors Integrals
- Regularized and structured tensor total least squares methods with applications
- Joint randomized algorithms for the federated low-multilinear-rank approximation of modified Tucker decomposition
- On extensions of the GD inverse of tensors via the M-product
- An accelerated block randomized Kaczmarz method
- A fast correction approach to tensor robust principal component analysis
- A tensor network low rank completion method
- Randomized algorithms for computing the generalized tensor SVD based on the tensor product
- Representations and computation of the BT inverse and its randomized algorithms
This page was built for publication: Fast randomized tensor singular value thresholding for low‐rank tensor optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5878508)
