scientific article; zbMATH DE number 7255100

zbMath1499.62205MaRDI QIDQ4969118

Morteza Ashraphijuo, Xiaodong Wang

Publication date: 5 October 2020

Full work available at URL: https://jmlr.csail.mit.edu/papers/v21/19-347.html

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

low-rank tensor completionfinite completabilityunique completabilitycanonical polyadic (CP) decompositionclustering tensor spacesunion of tensor spaces

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Multilinear algebra, tensor calculus (15A69) Matrix completion problems (15A83) Missing data (62D10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Low-rank tensor completion by Riemannian optimization
• Multiarray signal processing: tensor decomposition meets compressed sensing
• Fundamental conditions on the sampling pattern for union of low-rank subspaces retrieval
• Exact matrix completion via convex optimization
• A Singular Value Thresholding Algorithm for Matrix Completion
• Tensor completion and low-n-rank tensor recovery via convex optimization
• Low-Rank Data Completion With Very Low Sampling Rate Using Newton's Method
• The Power of Convex Relaxation: Near-Optimal Matrix Completion
• Fundamental Conditions for Low-CP-Rank Tensor Completion
• Data Clustering: Theory, Algorithms, and Applications
• Phase Retrieval via Matrix Completion

This page was built for publication: