Fundamental conditions on the sampling pattern for union of low-rank subspaces retrieval

DOI10.1007/S10472-019-09662-6zbMath1474.68312OpenAlexW2967351922WikidataQ127373491 ScholiaQ127373491MaRDI QIDQ2294578

Morteza Ashraphijuo, Xiaodong Wang

Publication date: 11 February 2020

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10472-019-09662-6

zbMATH Keywords

manifoldmatrix completionunion of subspacesfinite completabilityunique completabilitylow-rank data completion

Mathematics Subject Classification ID

Estimation in multivariate analysis (62H12) Statistics on manifolds (62R30) Matrix completion problems (15A83) Computational aspects of data analysis and big data (68T09)

Related Items (1)

Unnamed Item

Uses Software

• PhaseLift

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Low-rank tensor completion by Riemannian optimization
• Learning with tensors: a framework based on convex optimization and spectral regularization
• Exact matrix completion via convex optimization
• Robust Low-Rank Tensor Recovery: Models and Algorithms
• A Singular Value Thresholding Algorithm for Matrix Completion
• Tensor completion and low-n-rank tensor recovery via convex optimization
• Missing Data Recovery for High-Dimensional Signals With Nonlinear Low-Dimensional Structures
• Low-Rank Data Completion With Very Low Sampling Rate Using Newton's Method
• Deterministic and Probabilistic Conditions for Finite Completability of Low-Tucker-Rank Tensor
• The Power of Convex Relaxation: Near-Optimal Matrix Completion
• Fundamental Conditions for Low-CP-Rank Tensor Completion
• Phase Retrieval via Matrix Completion

This page was built for publication: Fundamental conditions on the sampling pattern for union of low-rank subspaces retrieval