References
- M. Fazel, 'Matrix rank minimization with applications,' Ph.D. dissertation, Stanford University, 2002
- B. Recht, M. Fazel, and P. Parrilo, 'Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization,' Arxiv preprint arXiv:0706.4138, 2007
- E. Candes and B. Recht, 'Exact Matrix Completion via Convex Optimization,' Arxiv preprint arXiv:0805.4471, 2008
- M. Fazel, H. Hindi, and S. Boyd, 'A rank minimization heuristic with application to minimum order system approximation,' in Proceedings American Control Conference, vol. 6, 2001, pp. 4734–4739
- G. Watson, 'On matrix approximation problems with Ky Fank norms,' Numerical Algorithms, vol. 5, no. 5, pp. 263–272, 1993 https://doi.org/10.1007/BF02210386
- J. Cai, E. Candes, and Z. Shen, "A singular value thresholding algorithm for matrix completion," Arxiv preprint arXiv:0810.3286, 2008
- K. Lee and Y. Bresler, 'Efficient and guaranteed rank minimization by atomic decomposition,' Arxiv preprint arXiv:0901.1898, 2009
- S. Mallat and Z. Zhang, 'Matching pursuits with time-frequency dictionaries,' IEEE Transactions on Signal Processing, vol. 41, no. 12, pp. 3397–3415, 1993 https://doi.org/10.1109/78.258082
- Y. Pati, R. Rezaiifar, and P. Krishnaprasad, 'Orthogonal matching pursuit: recursive function approximation with applications to wavelet decomposition,' in Proc. Asilomar Conf. on Signals, Systems, and Computers, vol. 1, Pacific Grove, CA, Nov. 1993, pp. 40–44
- D. Needell and J. Tropp, 'CoSaMP: Iterative signal recovery from incomplete and inaccurate samples,' Arxiv preprint arXiv:0803.2392, 2008
- W. Dai and O. Milenkovic, 'Subspace pursuit for compressive sensing: closing the gap between performance and complexity,' Arxiv preprint arXiv:0803.0811, 2008
- K. Lee and Y. Bresler, 'ADMiRA: Atomic Decomposition for Minimum Rank Approximation,' Arxiv preprint arXiv:0905.0044, 2009
- J. Haldar and D. Hernando, 'Rank-Constrained Solutions to Linear Matrix Equations using PowerFactorization,' will appear in IEEE Signal Processing Letters
- R. Keshavan, S. Oh, and A. Montanari, 'Matrix Completion from a Few Entries,' Arxiv preprint arXiv:0901.3150, 2009
- A. Edelman, T. Arias, and S. Smith, 'The Geometry of Algorithms with Orthogonality Constraints,' SIAM journal on matrix analysis and applications, vol. 20, no. 2, pp. 303–353, 1999 https://doi.org/10.1137/S0895479895290954
- M. Fazel, E. Candes, B. Recht, and P. Parrilo, 'Compressed sensing and robust recovery of low rank matrices,' in Proc. Asilomar Conf. on Signals, Systems, and Computers, Pacific Grove, CA, Oct. 2008
- R. Larsen, 'PROPACK–Software for large and sparse SVD calculations,' Available from http://soi.stanford.edu/ rmunk/PROPACK/
- S. Har-Peled, 'Low rank matrix approximation in linear time,' note, 2006
- L. Mirsky, 'Symmetric gauge functions and unitarily invariant norms,' The Quarterly Journal of Mathematics, vol. 11, no. 1, pp. 50-59, 1960 https://doi.org/10.1093/qmath/11.1.50