Robust Low-Rank Tensor Recovery: Models and Algorithms

DOI10.1137/130905010zbMath1296.65086arXiv1311.6182OpenAlexW1999136078MaRDI QIDQ2877087

Donald Goldfarb, Zhiwei Qin

Publication date: 21 August 2014

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

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

zbMATH Keywords

algorithmconvex optimizationnumerical examplesprincipal component analysisproximal gradient methodtensor decompositionslow-rank tensorsalternating direction augmented Lagrangianhigher-order robust PCAmultilinear data analysisTucker rankvariable-splitting

Mathematics Subject Classification ID

Related Items (29)

Towards Compact Neural Networks via End-to-End Training: A Bayesian Tensor Approach with Automatic Rank Determination ⋮ Minimum \( n\)-rank approximation via iterative hard thresholding ⋮ Completely positive tensor recovery with minimal nuclear value ⋮ Fast multidimensional completion and principal component analysis methods via the cosine product ⋮ Nonconvex Low-Rank Tensor Completion from Noisy Data ⋮ Background subtraction with Kronecker-basis-representation based tensor sparsity and \(l_{1,1,2}\) norm ⋮ Robust low transformed multi-rank tensor methods for image alignment ⋮ An approximation method of CP rank for third-order tensor completion ⋮ Enhanced image approximation using shifted rank-1 reconstruction ⋮ A patch-based low-rank tensor approximation model for multiframe image denoising ⋮ Continuity, differentiability and semismoothness of generalized tensor functions ⋮ Parallel active subspace decomposition for tensor robust principal component analysis ⋮ Half-quadratic alternating direction method of multipliers for robust orthogonal tensor approximation ⋮ Auto-weighted robust low-rank tensor completion via tensor-train ⋮ A generalized non-convex method for robust tensor completion ⋮ Tensor Robust Principal Component Analysis via Tensor Fibered Rank and \({\boldsymbol{{l_p}}}\) Minimization ⋮ Optimality conditions for Tucker low-rank tensor optimization ⋮ Characterization of sampling patterns for low-tt-rank tensor retrieval ⋮ Nonconvex optimization for robust tensor completion from grossly sparse observations ⋮ Nonconvex tensor rank minimization and its applications to tensor recovery ⋮ Alternating direction method of multipliers for generalized low-rank tensor recovery ⋮ Reducing uncertainty of dynamic heterogeneous information networks: a fusing reconstructing approach ⋮ Tensor \(N\)-tubal rank and its convex relaxation for low-rank tensor recovery ⋮ Dynamic background modeling using tensor representation and ant colony optimization ⋮ Fundamental conditions on the sampling pattern for union of low-rank subspaces retrieval ⋮ Low-Rank Approximation and Completion of Positive Tensors ⋮ Twist tensor total variation regularized-reweighted nuclear norm based tensor completion for video missing area recovery ⋮ Nonlocal robust tensor recovery with nonconvex regularization ^* ⋮ Unnamed Item

Uses Software

• LMaFit

This page was built for publication: Robust Low-Rank Tensor Recovery: Models and Algorithms