{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T20:34:52Z","timestamp":1774643692598,"version":"3.50.1"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2011,5,18]],"date-time":"2011-05-18T00:00:00Z","timestamp":1305676800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2011,9]]},"DOI":"10.1007\/s10107-011-0459-x","type":"journal-article","created":{"date-parts":[[2011,5,17]],"date-time":"2011-05-17T04:01:16Z","timestamp":1305604876000},"page":"69-89","source":"Crossref","is-referenced-by-count":50,"title":["Nuclear norm minimization for the planted clique and biclique problems"],"prefix":"10.1007","volume":"129","author":[{"given":"Brendan P. W.","family":"Ames","sequence":"first","affiliation":[]},{"given":"Stephen A.","family":"Vavasis","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,5,18]]},"reference":[{"key":"459_CR1","unstructured":"Ackerman, M., Ben-David, S.: Which data sets are \u2018clusterable\u2019?\u2014A theoretical study of clusterability (2008)"},{"key":"459_CR2","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1002\/(SICI)1098-2418(199810\/12)13:3\/4<457::AID-RSA14>3.0.CO;2-W","volume":"13","author":"N. Alon","year":"1998","unstructured":"Alon N., Krivelevich M., Sudakov B.: Finding a large hidden clique in a random graph. Random Struct. Algorithms 13, 457\u2013466 (1998)","journal-title":"Random Struct. Algorithms"},{"key":"459_CR3","doi-asserted-by":"crossref","unstructured":"Cand\u00e8s, E. J., Recht, B.: Exact matrix completion via convex optimization. Available from http:\/\/arxiv.org\/abs\/0805.4471 , May 2008","DOI":"10.1109\/ALLERTON.2008.4797640"},{"issue":"2","key":"459_CR4","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1109\/TIT.2005.862083","volume":"52","author":"E.J. Cand\u00e8s","year":"2006","unstructured":"Cand\u00e8s E.J., Romberg J., Tao T.: Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information. IEEE Trans. Inf. Theory 52(2), 489\u2013509 (2006)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"459_CR5","doi-asserted-by":"crossref","first-page":"1289","DOI":"10.1109\/TIT.2006.871582","volume":"52","author":"D.L. Donoho","year":"2006","unstructured":"Donoho D.L.: Compressed Sensing. IEEE Trans. Inf. Theory 52(4), 1289\u20131306 (2006)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"459_CR6","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1002\/(SICI)1098-2418(200003)16:2<195::AID-RSA5>3.0.CO;2-A","volume":"16","author":"U. Feige","year":"2000","unstructured":"Feige U., Krauthgamer R.: Finding and certifying a large hidden clique in a semirandom graph. Random Struct. Algorithms 16(2), 195\u2013208 (2000)","journal-title":"Random Struct. Algorithms"},{"issue":"3","key":"459_CR7","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1007\/BF02579329","volume":"1","author":"Z. F\u00fcredi","year":"1981","unstructured":"F\u00fcredi Z., Koml\u00f3s J.: The eigenvalues of random symmetric matrices. Combinatorica 1(3), 233\u2013241 (1981)","journal-title":"Combinatorica"},{"key":"459_CR8","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey M.R., Johnson D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, New York (1979)"},{"issue":"2","key":"459_CR9","doi-asserted-by":"crossref","first-page":"252","DOI":"10.1214\/aop\/1176994775","volume":"8","author":"S. Geman","year":"1980","unstructured":"Geman S.: A limit theorem for the norm of random matrices. Ann. Probab. 8(2), 252\u2013261 (1980)","journal-title":"Ann. Probab."},{"key":"459_CR10","doi-asserted-by":"crossref","unstructured":"Gilbert, A. C., Guha, S., Indyk, P., Muthukrishnan, S., Strauss, M.: Near-optimal sparse fourier representations via sampling. In: STOC \u201902: Proceedings of the Thiry-Fourth Annual ACM Symposium on Theory of Computing, pp. 152\u2013161. ACM, New York, NY, USA (2002)","DOI":"10.1145\/509931.509933"},{"key":"459_CR11","unstructured":"Gillis, N., Glineur, F.: Nonnegative factorization and the maximum edge biclique problem. Available from http:\/\/arxiv.org\/abs\/0810.4225 , (2008)"},{"key":"459_CR12","doi-asserted-by":"crossref","unstructured":"H\u00e5stad, J.: Clique is hard to approximate within $${n^{1-\\epsilon}}$$ . In: 37th Annual Symposium on Foundations of Computer Science (Burlington, VT, 1996), pp. 627\u2013636. IEEE Computer Society Press, Los Alamitos, CA (1996)","DOI":"10.1109\/SFCS.1996.548522"},{"key":"459_CR13","doi-asserted-by":"crossref","first-page":"13","DOI":"10.2307\/2282952","volume":"58","author":"W. Hoeffding","year":"1962","unstructured":"Hoeffding W.: Probability inequalities for sums of bounded random variables. J. Am. Stat. Assoc. 58, 13\u201330 (1962)","journal-title":"J. Am. Stat. Assoc."},{"issue":"1","key":"459_CR14","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1023\/A:1009877331765","volume":"5","author":"L.D. Iasemidis","year":"2001","unstructured":"Iasemidis L.D., Pardalos P., Sackellares J.C., Shiau D.-S.: Quadratic binary programming and dynamical system approach to determine the predictability of epileptic seizures. J. Comb. Optim. 5(1), 9\u201326 (2001)","journal-title":"J. Comb. Optim."},{"key":"459_CR15","doi-asserted-by":"crossref","unstructured":"McSherry, F.: Spectral partitioning of random graphs. In: Proceedings of the 42nd IEEE Symposium on Foundations of Computer Science, pp. 529\u2013537. IEEE Computer Society (2001)","DOI":"10.1109\/SFCS.2001.959929"},{"key":"459_CR16","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511813603","volume-title":"Probability and Computing","author":"M. Mitzenmacher","year":"2005","unstructured":"Mitzenmacher M., Upfal E.: Probability and Computing. Cambridge University Press, Cambridge (2005)"},{"key":"459_CR17","doi-asserted-by":"crossref","first-page":"651","DOI":"10.1016\/S0166-218X(03)00333-0","volume":"131","author":"R. Peeters","year":"2003","unstructured":"Peeters R.: The maximum edge biclique problem is NP-complete. Discrete Appl. Math. 131, 651\u2013654 (2003)","journal-title":"Discrete Appl. Math."},{"key":"459_CR18","unstructured":"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)"},{"key":"459_CR19","unstructured":"Rockafellar, R.T.: Convex Analysis. Princeton Landmarks in Mathematics. Princeton University Press, Princeton, NJ (1997) (Reprint of the 1970 original, Princeton Paperbacks)"},{"key":"459_CR20","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/0024-3795(92)90407-2","volume":"170","author":"G.A. Watson","year":"1992","unstructured":"Watson G.A.: Characterization of the subdifferential of some matrix norms. Linear Algebra Appl. 170, 33\u201345 (1992)","journal-title":"Linear Algebra Appl."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-011-0459-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-011-0459-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-011-0459-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,5]],"date-time":"2025-03-05T15:18:01Z","timestamp":1741187881000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-011-0459-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,5,18]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2011,9]]}},"alternative-id":["459"],"URL":"https:\/\/doi.org\/10.1007\/s10107-011-0459-x","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,5,18]]}}}