On lines and planes of closest fit to a system of points in spcae
K. Pearson · 1901
Earlier work this paper cites.
Analysis of a complex of statistical variables into principal components
H. Hotelling · 1933
Earlier work this paper cites.
The method of paired comparisons
H. David · 1963
Earlier work this paper cites.
Phase retrieval algorithms: A comparison
J. Fienup · 1982
Earlier work this paper cites.
Matrix Analysis
R. Horn and C. Johnson · 1985
Earlier work this paper cites.
On Milman’s inequality and random subspaces which escape through a mesh in ℝ n \mathbb{R}^{n}
Y. Gordon · 1988
Earlier work this paper cites.
Using collaborative filtering to weave an information tapestry
D. Goldberg, D. Nichols, B. Oki, and D. Terry · 1992
Earlier work this paper cites.
Blind Deconvolution
S. Haykin, editor · 1994
Earlier work this paper cites.
The geometry of graphs and some of its algorithmic applications
N. Linial, E. London, and Y. Rabinovich · 1995
Earlier work this paper cites.
Natural image statistics and efficient coding
B. Olshausen and D. Field · 1996
Earlier work this paper cites.
Multichannel blind identification: From subspace to maximum likelihood methods
L. Tong and S. Perreau · 1998
Earlier work this paper cites.
A probabilistic framework for the adaptation and comparison of image codes
M. Lewicki and B. Olshausen · 1999
Earlier work this paper cites.
Adaptive estimation of a quadratic functional by model selection
B. Laurent and P. Massart · 2000
Earlier work this paper cites.
Low-rank matrix approximation using the Lanczos bidiagonalization process with applications
H. Simon and H. Zha · 2000
Earlier work this paper cites.
Strong converse for identification via quantum channels
R. Ahlswede and A. Winter · 2002
Earlier work this paper cites.
Matrix rank minimization with applications
M. Fazel · 2002
Earlier work this paper cites.
A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
S. Burer and R. Monteiro · 2003
Earlier work this paper cites.
Log-det heuristic for matrix rank minimization with applications to hankel and euclidean distance matrices
M. Fazel, H. Hindi, and S. Boyd · 2003
Earlier work this paper cites.
Latent semantic analysis
S. Dumais · 2004
Earlier work this paper cites.
Learning with matrix factorizations
N. Srebro · 2004
Earlier work this paper cites.
Maximum margin matrix factorization
N. Srebro, J. Rennie, and T. Jaakkola · 2004
Earlier work this paper cites.
Local minima and convergence in low-rank semidefinite programming
S. Burer and R. Moneteiro · 2005
Earlier work this paper cites.
Fast maximum margin matrix factorization for collaborative prediction
J. Rennie and N. Srebro · 2005
Earlier work this paper cites.
Rank, trace-norm and max-norm
N. Srebro and A. Shraibman · 2005
Earlier work this paper cites.
On signal reconstruction without phase
R. Balan, P. Casazza, and D. Edidin · 2006
Earlier work this paper cites.
Semidefinite programming based algorithms for sensor network localization
P. Biswas, T-C. Lian, T-C. Wang, and Y. Ye · 2006
Earlier work this paper cites.
Compressive sampling
E. Candès · 2006
Earlier work this paper cites.
Compressed sensing
D. Donoho · 2006
Earlier work this paper cites.
Sparse principal component analysis
H. Zou, T. Hastie, and R. Tibshirani · 2006
Earlier work this paper cites.
Blind Image Deconvolution
P. Campisi and K. Egiazarian, editors · 2007
Earlier work this paper cites.
Theory of semidefinite programming for sensor network localization
A. So and Y. Ye · 2007
Earlier work this paper cites.
Convex multi-taks feature learning
A. Argyriou, T. Evgeniou, and M. Pontil · 2008
Earlier work this paper cites.
Nonnegative matrix factorization based on alternating nonnegativity constrained least squares and active set method
H. Kim and H. Park · 2008
Earlier work this paper cites.
A remark on global positioning from local distances
A. Singer · 2008
Earlier work this paper cites.
A fast iterative shrinkage-thresholding algorithm for linear inverse problems
A. Beck and M. Teboulle · 2009
Earlier work this paper cites.
Exact matrix completion via convex optimization
E. Candès and B. Recht · 2009
Earlier work this paper cites.
Rank-constrained solutions to linear matrix equations using power factorization
J. Haldar and D. Hernando · 2009
Earlier work this paper cites.
Matrix factorization techniques for recommender systems
Y. Koren, R. Bell, and C. Volinsky · 2009
Earlier work this paper cites.
Interior-point method for nuclear norm approximation with application to system identification
Z. Liu and L. Vandenberghe · 2009
Earlier work this paper cites.
Modern multidimensional scaling
I. Borg and P. Groenen · 2010
Earlier work this paper cites.
A singular value thresholding algorithm for matrix completion
J-F. Cai, E. Candès, and Z. Shen · 2010
Earlier work this paper cites.
Matrix completion with noise
E. Candès and Y. Plan · 2010
Earlier work this paper cites.
The power of convex relaxation: Near-optimal matrix completion
E. Candès and T. Tao · 2010
Earlier work this paper cites.
Coresets, sparse greedy approximation, and the Frank-Wolfe algorithm
K. Clarkson · 2010
Earlier work this paper cites.
Quantum state tomography via compressed sensing
D. Gross, Y-K. Liu, S. Flammia, S. Becker, and J. Eisert · 2010
Earlier work this paper cites.
A simple algorithm for nuclear norm regularized problems
M. Jaggi and M. Sulovsk · 2010
Earlier work this paper cites.