Robust Low-Rank Matrix Completion by Riemannian Optimization
Publication:2830625
DOI10.1137/15M1025153zbMath1352.65149OpenAlexW2266965707WikidataQ115246968 ScholiaQ115246968MaRDI QIDQ2830625
Pierre-Antoine Absil, Leopold Cambier
Publication date: 28 October 2016
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/15m1025153
outliersalgorithmconvergencenumerical experimentsmoothing techniquesnonsmoothlow-rank matrix completionRiemannian optimization\(\ell_1\) normfixed-rank manifold
Numerical mathematical programming methods (65K05) Linear programming (90C05) Matrix completion problems (15A83)
Related Items (18)
Uses Software
Cites Work
- Unnamed Item
- Exact low-rank matrix completion from sparsely corrupted entries via adaptive outlier pursuit
- Low-rank retractions: a survey and new results
- Robust matrix completion
- Theory of semidefinite programming for sensor network localization
- Compressed sensing and matrix completion with constant proportion of corruptions
- Low-rank matrix completion via preconditioned optimization on the Grassmann manifold
- Exact matrix completion via convex optimization
- Low-Rank Matrix Completion by Riemannian Optimization
- Manopt, a Matlab toolbox for optimization on manifolds
- Robust principal component analysis?
- A Riemannian geometry with complete geodesics for the set of positive semidefinite matrices of fixed rank
This page was built for publication: Robust Low-Rank Matrix Completion by Riemannian Optimization