Nuclear norm minimization for the planted clique and biclique problems

Mathematical Programming

Volumn 129, Issue 1, 2011, Pages 69-89

  Ames, Brendan P W ^a   Vavasis, Stephen A ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

65K05; 68Q25; Mathematics Subject Classification (2000): 90C25

Indexed keywords

65K05; 68Q25; BICLIQUE; BIPARTITE GRAPHS; EXACT SOLUTION; INPUT GRAPHS; MAXIMUM CLIQUE; NP-HARD; OPTIMIZATION PROBLEMS; RANDOM EDGES;

ALGORITHMS;

EID: 80052581489     PISSN: 00255610     EISSN: 14364646     Source Type: Journal    
DOI: 10.1007/s10107-011-0459-x     Document Type: Article

References (20)

1. Ackerman, M., Ben-David, S.: Which data sets are 'clusterable'?-A theoretical study of clusterability (2008)
2. N. Alon M. Krivelevich B. Sudakov 1998 Finding a large hidden clique in a random graph Random Struct. Algorithms 13 457 466 1662795 0959.05082 10.1002/(SICI)1098-2418(199810/12)13:3/4<457::AID-RSA14>3.0.CO;2-W
3. Candès, E. J., Recht, B.: Exact matrix completion via convex optimization. Available from http://arxiv.org/abs/0805.4471, May 2008
4. E.J. Candès J. Romberg T. Tao 2006 Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information IEEE Trans. Inf. Theory 52 2 489 509 10.1109/TIT.2005.862083 (Pubitemid 43174093)
5. D.L. Donoho 2006 Compressed Sensing IEEE Trans. Inf. Theory 52 4 1289 1306 2241189 10.1109/TIT.2006.871582
6. U. Feige R. Krauthgamer 2000 Finding and certifying a large hidden clique in a semirandom graph Random Struct. Algorithms 16 2 195 208 1742351 0940.05050 10.1002/(SICI)1098-2418(200003)16:2<195::AID-RSA5>3.0.CO;2-A
7. Z. Füredi J. Komlós 1981 The eigenvalues of random symmetric matrices Combinatorica 1 3 233 241 637828 0494.15010 10.1007/BF02579329
8. Garey M.R., Johnson D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, New York (1979)
9. S. Geman 1980 A limit theorem for the norm of random matrices Ann. Probab. 8 2 252 261 566592 0428.60039 10.1214/aop/1176994775
10. Gilbert, A. C., Guha, S., Indyk, P., Muthukrishnan, S., Strauss, M.: Near-optimal sparse fourier representations via sampling. In: STOC '02: Proceedings of the Thiry-Fourth Annual ACM Symposium on Theory of Computing, pp. 152-161. ACM, New York, NY, USA (2002) (Pubitemid 35009373)
11. Gillis, N., Glineur, F.: Nonnegative factorization and the maximum edge biclique problem. Available from http://arxiv.org/abs/0810.4225, (2008)
12. 1-. In: 37th Annual Symposium on Foundations of Computer Science (Burlington, VT, 1996), pp. 627-636. IEEE Computer Society Press, Los Alamitos, CA (1996)
13. W. Hoeffding 1962 Probability inequalities for sums of bounded random variables J. Am. Stat. Assoc. 58 13 30 144363 10.2307/2282952
14. L.D. Iasemidis P. Pardalos J.C. Sackellares D.-S. Shiau 2001 Quadratic binary programming and dynamical system approach to determine the predictability of epileptic seizures J. Comb. Optim. 5 1 9 26 1825630 1050.92031 10.1023/A:1009877331765 (Pubitemid 33635451)
15. McSherry, F.: Spectral partitioning of random graphs. In: Proceedings of the 42nd IEEE Symposium on Foundations of Computer Science, pp. 529-537. IEEE Computer Society (2001) (Pubitemid 33068414)
16. Mitzenmacher M., Upfal E.: Probability and Computing. Cambridge University Press, Cambridge (2005)
17. R. Peeters 2003 The maximum edge biclique problem is NP-complete Discrete Appl. Math. 131 651 654 2011374 1026.68068 10.1016/S0166-218X(03)00333-0
18. Recht, B., Fazel, M., Parrilo, P.: Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization. Available from http://arxiv.org/abs/0706.4138 (2007)
19. Rockafellar, R.T.: Convex Analysis. Princeton Landmarks in Mathematics. Princeton University Press, Princeton, NJ (1997) (Reprint of the 1970 original, Princeton Paperbacks)
20. G.A. Watson 1992 Characterization of the subdifferential of some matrix norms Linear Algebra Appl. 170 33 45 1160950 0751.15011 10.1016/0024-3795(92) 90407-2