Low-rank approximation pursuit for matrix completion
Authors:
- An-Bao XuAXAn-Bao Xu
- Dongxiu XieDXDongxiu Xie
- 1 October 2017
- journal article
- Published by Elsevier in Mechanical Systems and Signal Processing
- Vol. 95, 77-89
Abstract
No abstract availableThis publication has 12 references indexed in Scilit:
- Orthogonal Rank-One Matrix Pursuit for Low Rank Matrix CompletionSIAM Journal on Scientific Computing, 2015
- Rank-penalized estimation of a quantum systemPhysical Review A, 2013
- Finding Structure with Randomness: Probabilistic Algorithms for Constructing Approximate Matrix DecompositionsSIAM Review, 2011
- Quantum State Tomography via Compressed SensingPhysical Review Letters, 2010
- ADMiRA: Atomic Decomposition for Minimum Rank ApproximationIEEE Transactions on Information Theory, 2010
- Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm MinimizationSIAM Review, 2010
- A Singular Value Thresholding Algorithm for Matrix CompletionSIAM Journal on Optimization, 2010
- Matrix Factorization Techniques for Recommender SystemsComputer, 2009
- Exact Matrix Completion via Convex OptimizationFoundations of Computational Mathematics, 2009
- Greed is Good: Algorithmic Results for Sparse ApproximationIEEE Transactions on Information Theory, 2004