Matrix completion with sparse measurement errors

DOI10.1007/s10092-022-00500-6OpenAlexW4316661454MaRDI QIDQ2685993

Yanyan Li

Publication date: 23 February 2023

Published in: Calcolo (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10092-022-00500-6

zbMATH Keywords

matrix completionrestricted isometry propertyprojected gradientlow rank plus sparseSVD perturbation

Mathematics Subject Classification ID

Matrix completion problems (15A83) Numerical methods for low-rank matrix approximation; matrix compression (65F55)

Cites Work

• Matrix completion by singular value thresholding: sharp bounds
• Convex multi-task feature learning
• Tutorial on large deviations for the binomial distribution
• Low-rank approximation algorithms for matrix completion with random sampling
• Guarantees of Riemannian optimization for low rank matrix completion
• Guarantees of Riemannian Optimization for Low Rank Matrix Recovery
• Low-Rank Matrix Completion by Riemannian Optimization
• Compressive Multiplexing of Correlated Signals
• Geometric Methods on Low-Rank Matrix and Tensor Manifolds
• Subspaces, angles and pairs of orthogonal projections
• The complexity of matrix completion
• A Simpler Approach to Matrix Completion
• Some new bounds on perturbation of subspaces
• Perturbation bounds in connection with singular value decomposition

This page was built for publication: Matrix completion with sparse measurement errors