Low-CP-rank tensor completion via practical regularization

DOI10.1007/s10915-022-01789-9zbMath1495.65062arXiv2103.16852OpenAlexW3148396924MaRDI QIDQ2113663

Carmeliza Navasca, Fatoumata Sanogo, Jiahua Jiang

Publication date: 14 March 2022

Published in: Journal of Scientific Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2103.16852

zbMATH Keywords

tensorregularizationmodel order reductiontensor completionhybrid projection methods

Mathematics Subject Classification ID

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

Related Items

TR-STF: a fast and accurate tensor ring decomposition algorithm via defined scaled tri-factorization

Uses Software

• Matlab

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• The projected GSURE for automatic parameter tuning in iterative shrinkage methods
• Approximation of skewed interfaces with tensor-based model reduction procedures: application to the reduced basis hierarchical model reduction approach
• A weighted-GCV method for Lanczos-hybrid regularization
• A bidiagonalization algorithm for solving large and sparse ill-posed systems of linear equations
• Estimation of the mean of a multivariate normal distribution
• Three-way arrays: rank and uniqueness of trilinear decompositions, with application to arithmetic complexity and statistics
• Some convergence results on the regularized alternating least-squares method for tensor decomposition
• Tensor methods for the Boltzmann-BGK equation
• Local Convergence of the Alternating Least Squares Algorithm for Canonical Tensor Approximation
• Convergence Rates for Greedy Algorithms in Reduced Basis Methods
• Spectral Methods for Time-Dependent Problems
• A Bidiagonalization-Regularization Procedure for Large Scale Discretizations of Ill-Posed Problems
• Spectral Methods in MATLAB
• Linear Support Tensor Machine With LSK Channels: Pedestrian Detection in Thermal Infrared Images
• Sparse Regularization via Convex Analysis
• Low‐rank approximation of tensors via sparse optimization
• Computational Methods for Inverse Problems
• Flexible Krylov Methods for $\ell_p$ Regularization
• The Power of Convex Relaxation: Near-Optimal Matrix Completion
• Discrete Inverse Problems
• Algorithms for Numerical Analysis in High Dimensions
• Krylov methods for inverse problems: Surveying classical, and introducing new, algorithmic approaches