Convex optimization for the planted k-disjoint-clique problem

Probability inequalities for sums of bounded random variables

W. Hoeffding · 1962

Earlier work this paper cites.

Computers and Intractability: A Guide to the Theory of NP-Completeness

M. R. Garey and D. S. Johnson · 1979

Earlier work this paper cites.

A limit theorem for the norm of random matrices

S. Geman · 1980

Earlier work this paper cites.

The eigenvalues of random symmetric matrices

Z. Füredi and J. Komlós · 1981

Earlier work this paper cites.

Matrix Computations

G. Golub and C. Van Loan · 1996

Earlier work this paper cites.

Finding a large hidden clique in a random graph

N. Alon, M. Krivelevich, and B. Sudakov · 1998

Earlier work this paper cites.

Finding and certifying a large hidden clique in a semirandom raph

U. Feige and R. Krauthgamer · 2000

Earlier work this paper cites.

Convex optimization

S. Boyd and L. Vandenberghe · 2004

Cited alongside, same era.

Probability and computing

M. Mitzenmacher and E. Upfal · 2005

Cited alongside, same era.

A survey of clustering data mining techniques

P. Berkhin · 2006

Cited alongside, same era.

The effectiveness of Lloyd-type methods for the k-means problem

R. Ostrovsky, Y. Rabani, L. Schulman, and C. Swamy · 2006

Cited alongside, same era.

Exact matrix completion via convex optimization

E.J. Candès and B. Recht · 2009

Cited alongside, same era.

Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization

B. Recht, M. Fazel, and P.A. Parrilo · 2010

Cited alongside, same era.

A newton-cg augmented lagrangian method for semidefinite programming

X.Y. Zhao, D. Sun, and K.C. Toh · 2010

Closest in time.

Nuclear norm minimization for the planted clique and biclique problems

B. Ames and S. Vavasis · 2011

Closest in time.

Robust principal component analysis?

E.J. Candès, X. Li, Y. Ma, and J. Wright · 2011

Closest in time.

Rank-sparsity incoherence for matrix decomposition

V. Chandrasekaran, S. Sanghavi, P.A. Parrilo, and A.S. Willsky · 2011

Closest in time.

Clustering partially observed graphs via convex optimization

Original

A. Jalali, Y. Chen, S. Sanghavi, and H. Xu · 2011

Closest in time.

Finding dense clusters via “low rank + sparse” decomposition

Original