A tensor train approach for internet traffic data completion
From MaRDI portal
Publication:6601544
DOI10.1007/s10479-021-04147-4MaRDI QIDQ6601544
Zhiyuan Zhang, Hongjin He, Chen Ling, Liqun Qi
Publication date: 10 September 2024
Published in: Annals of Operations Research (Search for Journal in Brave)
Communication networks in operations research (90B18) Traffic problems in operations research (90B20) Multilinear algebra, tensor calculus (15A69) Numerical methods for low-rank matrix approximation; matrix compression (65F55)
Cites Work
- Tensor Decompositions and Applications
- Tensor-Train Decomposition
- TT-cross approximation for multidimensional arrays
- On tensor completion via nuclear norm minimization
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- Iterative \(p\)-shrinkage thresholding algorithm for low Tucker rank tensor recovery
- Optimization on the hierarchical Tucker manifold - applications to tensor completion
- Analysis of individual differences in multidimensional scaling via an \(n\)-way generalization of ``Eckart-Young decomposition
- The approximation of one matrix by another of lower rank.
- Exact matrix completion via convex optimization
- Guarantees of Riemannian Optimization for Low Rank Matrix Recovery
- Limited Memory Block Krylov Subspace Optimization for Computing Dominant Singular Value Decompositions
- Robust Inexact Alternating Optimization for Matrix Completion with Outliers
- A Multilinear Singular Value Decomposition
- Efficient Tensor Completion for Color Image and Video Recovery: Low-Rank Tensor Train
- Fast and Accurate Tensor Completion With Total Variation Regularized Tensor Trains
- Tensor Rank and the Ill-Posedness of the Best Low-Rank Approximation Problem
- Most Tensor Problems Are NP-Hard
- A low-rank and sparse enhanced Tucker decomposition approach for tensor completion
This page was built for publication: A tensor train approach for internet traffic data completion
