Deterministic algorithms for matrix completion
- 25 January 2013
- journal article
- Published by Wiley in Random Structures & Algorithms
- Vol. 45 (2) , 306-317
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Nuclear-norm penalization and optimal rates for noisy low-rank matrix completionThe Annals of Statistics, 2011
- The Power of Convex Relaxation: Near-Optimal Matrix CompletionIEEE Transactions on Information Theory, 2010
- Twice-ramanujan sparsifiers2009
- Exact Matrix Completion via Convex OptimizationFoundations of Computational Mathematics, 2009
- Expander graphs and their applicationsBulletin of the American Mathematical Society, 2006
- Ramanujan graphsCombinatorica, 1988
- Summing and Nuclear Norms in Banach Space Theory1987