A mixture of nuclear norm and matrix factorization for tensor completion

DOI10.1007/S10915-017-0521-9zbMath1405.65059OpenAlexW2739919291MaRDI QIDQ1747028

Shangqi Gao, Qibin Fan

Publication date: 26 April 2018

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

Full work available at URL: https://doi.org/10.1007/s10915-017-0521-9

zbMATH Keywords

nuclear normtensor completion

Mathematics Subject Classification ID

Factorization of matrices (15A23) Multilinear algebra, tensor calculus (15A69) Matrix completion problems (15A83)

Related Items (6)

Tensor train rank minimization with hybrid smoothness regularization for visual data recovery ⋮ Fast multidimensional completion and principal component analysis methods via the cosine product ⋮ The global Golub-Kahan method and Gauss quadrature for tensor function approximation ⋮ Robust Schatten-\(p\) norm based approach for tensor completion ⋮ Low-rank tensor completion using matrix factorization based on tensor train rank and total variation ⋮ A tensor regularized nuclear norm method for image and video completion

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Tensor Decompositions and Applications
• Tensor-Train Decomposition
• Smooth minimization of non-smooth functions
• Parallel matrix factorization for low-rank tensor completion
• Fixed point and Bregman iterative methods for matrix rank minimization
• An alternating direction algorithm for matrix completion with nonnegative factors
• Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm
• A new scheme for the tensor representation
• Optimization theory and methods. Nonlinear programming
• Exact matrix completion via convex optimization
• Dictionary Learning for Noisy and Incomplete Hyperspectral Images
• Hierarchical Singular Value Decomposition of Tensors
• A Singular Value Thresholding Algorithm for Matrix Completion
• Matrix completion via an alternating direction method
• Breaking the Curse of Dimensionality, Or How to Use SVD in Many Dimensions
• Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
• A Multilinear Singular Value Decomposition
• Numerical operator calculus in higher dimensions
• Fourth-Order Cumulant-Based Blind Identification of Underdetermined Mixtures
• Uniform-Geometric distribution
• Convergence of a block coordinate descent method for nondifferentiable minimization

This page was built for publication: A mixture of nuclear norm and matrix factorization for tensor completion