Fundamental Conditions for Low-CP-Rank Tensor Completion

zbMath1439.15009arXiv1703.10740MaRDI QIDQ5361335

Morteza Ashraphijuo, Xiaodong Wang

Publication date: 27 September 2017

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

zbMATH Keywords

algebraic geometryBernstein's theoremlow-rank tensor completioncanonical polyadic decompositionfinite completabilityunique completability

Mathematics Subject Classification ID

Vector and tensor algebra, theory of invariants (15A72) Multilinear algebra, tensor calculus (15A69) Exterior algebra, Grassmann algebras (15A75) Matrix completion problems (15A83)

Related Items (8)

Unnamed Item ⋮ Nonconvex Low-Rank Tensor Completion from Noisy Data ⋮ An approximation method of CP rank for third-order tensor completion ⋮ Characterization of sampling patterns for low-tt-rank tensor retrieval ⋮ Fundamental conditions on the sampling pattern for union of low-rank subspaces retrieval ⋮ Nonlocal robust tensor recovery with nonconvex regularization ^* ⋮ Riemannian conjugate gradient descent method for fixed multi rank third-order tensor completion ⋮ Unnamed Item

This page was built for publication: Fundamental Conditions for Low-CP-Rank Tensor Completion