Fetching the paper…
Reading the bibliography…
Nuclear norm minimization (NNM) has recently gained significant attention for its use in rank minimization problems.
V. A. Marcenko, L. A. Pastur, “Distributions of eigenvalues for some sets of random matrices,Ó Math USSR-Sbornik, vol. 1, pp. 457Ð483, 1967
1967
Earlier work this paper cites.
L. Mirsky, (1975), “A trace inequality of John von Neumann”, Monatsh. Math. 79 (4): 303Ð306
1975
Earlier work this paper cites.
Y. Gordan, “Some inequalities for Gaussian processes and applications,” Israel Journal of Math 50, 265-289 (1985)
1985
Earlier work this paper cites.
Roger A. Horn, Charles R. Johnson, “Matrix Analysis,” Cambridge [Cambridgeshire] ; New York : Cambridge University Press, 1985
1985
Earlier work this paper cites.
Y. Gordon. “On MilmanÕs inequality and random subspaces which escape through a mesh in ℝ n \mathbb{R}^{n} ,” Geometric Aspect of of functional analysis, Isr. Semin. 1986-87, Lect. Notes Math, 1317, 1988
1988
Earlier work this paper cites.
M. Ledoux, M. Talagrand, “Probability in Banach Spaces,” Springer-Verlag, Berlin (1991)
1991
Earlier work this paper cites.
R. Bhatia, (1996), “Matrix Analysis (Graduate Texts in Mathematics)”. Springer
1996
Earlier work this paper cites.
V.L. Girko, “An introduction to statistical analysis of random arrays,” Walter de Gruyter (December 1998)
1998
Cited alongside, same era.
C.-K. Li, R. Mathias, “The Lidskii-Mirsky-Wielandt theorem Ð additive and multiplicative versions”. Numerische Matematik; Springer-Verlak 1999
1999
Cited alongside, same era.
M. Fazel, “Matrix rank minimization with applications,” Ph.D. thesis, Stanford University (2002)
2002
Cited alongside, same era.
2003
Cited alongside, same era.
D. Donoho, “Compressed Sensing,” Technical Report 2004
2004
Cited alongside, same era.
D. Donoho, J. Tanner, “Thresholds for the recovery of sparse solutions via ell-1 minimization,” Conf. on Information Sciences and Systems, March 2006
2006
Later among the works it cites.
B. Recht, M. Fazel and P. Parrilo, “Guaranteed minimum rank solutions of matrix equations via nuclear norm minimization,” SIAM Review (2007)
2007
Later among the works it cites.
M. Stojnic, W. Xu, B. Hassibi, “Compressed sensing - probabilistic analysis of a null-space characterization,” ICASSP 2008
2008
Later among the works it cites.
Candès, E., Recht, B.: Exact matrix completion via convex optimization. Foundations of Computational Mathematics 9(6), 717-772 (2009)
2009
Later among the works it cites.
B. Recht, W. Xu, and B. Hassibi, “Null Space Conditions and Thresholds for Rank Minimization,” To appear in Mathematical Programming Revised, 2010
2010
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
David Donoho and Jared Tanner,“Neighborlyness of randomly-projected simplices in high dimensions,” Proc. National Academy of Sciences
2005
Cited alongside, same era.
D. Donoho, “Thresholds for the recovery of sparse solutions via ℓ 1 \ell_{1} minimization,” Proc. Conf. on Information Sciences and Systems, March 2006
2006
Cited alongside, same era.
E. J. Candès,“The restricted isometry property and its implications for compressed sensing,” Compte Rendus de l’Academie des Sciences, Paris, Serie I, 346 589-592
Cited in the paper.
S. Oymak, A. Khajehnejad, B. Hassibi, “Improved Thresholds for Rank Minimization, Full Report,” preprint
Cited in the paper.
Cited in the paper.
E. J. Cands and Y. Plan. “Tight oracle bounds for low-rank matrix recovery from a minimal number of random measurements.”
Cited in the paper.
Closest in time.
W. Xu, “On the Uniqueness of Positive Semidefinite Matrix Solution under Compressed Observations”. ISIT 2010. Austin, Texas
2010
Closest in time.