A tensor network low rank completion method

DOI10.1007/S40314-024-03031-8MaRDI QIDQ7033356zbMATH OpenFDO

Authors Abdeslem H. Bentbib, Khalide Jbilou, Sanaa Khobizy

Publication date 3 February 2025

Published in Computational and Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

multiplex networktensor completiontensor ring decompositiont-SVT algorithmTNCRTR algorithm

Mathematics Subject Classification ID

Multilinear algebra, tensor calculus (15A69) Numerical methods for low-rank matrix approximation; matrix compression (65F55)

Cites work

• A fast algorithm for rank-\((L, M, N)\) block term decomposition of multi-dimensional data
• A random sampling algorithm for fully-connected tensor network decomposition with applications
• A tensor regularized nuclear norm method for image and video completion
• Efficient Tensor Completion for Color Image and Video Recovery: Low-Rank Tensor Train
• Factorization strategies for third-order tensors
• Fast randomized tensor singular value thresholding for low‐rank tensor optimization
• Interior-point method for nuclear norm approximation with application to system identification
• Perron communicability and sensitivity of multilayer networks
• Practical sketching-based randomized tensor ring decomposition.
• Rank minimization on tensor ring: an efficient approach for tensor decomposition and completion
• Regularized and structured tensor total least squares methods with applications
• SVD-based algorithms for fully-connected tensor network decomposition
• Tensor Decompositions and Applications
• Tensor completion using total variation and low-rank matrix factorization
• The generalized inverses of tensors and an application to linear models

This page was built for publication: A tensor network low rank completion method

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7033356)