The Geometry of Rank-One Tensor Completion

DOI10.1137/16M1074102zbMath1375.14193arXiv1605.01678MaRDI QIDQ5347300

Thomas Kahle, Zvi Rosen, Mario Kummer, Kaie Kubjas

Publication date: 23 May 2017

Published in: SIAM Journal on Applied Algebra and Geometry (Search for Journal in Brave)

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

zbMATH Keywords

probability distributiontensor completionrank-one tensor

Mathematics Subject Classification ID

15A72: Vector and tensor algebra, theory of invariants

14P05: Real algebraic sets

14P10: Semialgebraic sets and related spaces

13P25: Applications of commutative algebra (e.g., to statistics, control theory, optimization, etc.)

Related Items

The Relation Between a Tensor and Its Associated Semi-Symmetric Form, Typical ranks in symmetric matrix completion, Typical and generic ranks in matrix completion

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Tensor Decompositions and Applications
• On tensor completion via nuclear norm minimization
• Toric ideals generalized by quadratic binomials
• Binomial ideals
• The convex geometry of linear inverse problems
• Algebraic boundaries of \(\mathrm{SO}(2)\)-orbitopes
• Determinantal representations of hyperbolic plane curves: an elementary approach
• Toric algebra of hypergraphs
• Exact matrix completion via convex optimization
• Uniqueness of Low-Rank Matrix Completion by Rigidity Theory
• Tensor completion and low-n-rank tensor recovery via convex optimization
• Matrix Completion for the Independence Model
• Rees algebras of edge ideals
• The Power of Convex Relaxation: Near-Optimal Matrix Completion
• Rank-one completions of partial matrices and completely rank-nonincreasing linear functionals
• Blind Multilinear Identification
• Most Tensor Problems Are NP-Hard
• The Algebraic Combinatorial Approach for Low-Rank Matrix Completion