Nuclear norm minimization for the planted clique and biclique problems
- 18 May 2011
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 129 (1) , 69-89
- https://doi.org/10.1007/s10107-011-0459-x
Abstract
No abstract availableAll Related Versions
This publication has 14 references indexed in Scilit:
- Exact low-rank matrix completion via convex optimizationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2008
- Compressed sensingIEEE Transactions on Information Theory, 2006
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency informationIEEE Transactions on Information Theory, 2006
- Near-optimal sparse fourier representations via samplingPublished by Association for Computing Machinery (ACM) ,2002
- Quadratic Binary Programming and Dynamical System Approach to Determine the Predictability of Epileptic SeizuresJournal of Combinatorial Optimization, 2001
- Finding and certifying a large hidden clique in a semirandom graphRandom Structures & Algorithms, 2000
- Finding a large hidden clique in a random graphRandom Structures & Algorithms, 1998
- The eigenvalues of random symmetric matricesCombinatorica, 1981
- A Limit Theorem for the Norm of Random MatricesThe Annals of Probability, 1980
- Probability Inequalities for Sums of Bounded Random VariablesJournal of the American Statistical Association, 1963