{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T09:03:32Z","timestamp":1750323812967},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2014,2,12]],"date-time":"2014-02-12T00:00:00Z","timestamp":1392163200000},"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":[[2014,12]]},"DOI":"10.1007\/s10107-014-0751-7","type":"journal-article","created":{"date-parts":[[2014,2,11]],"date-time":"2014-02-11T03:48:26Z","timestamp":1392090506000},"page":"89-110","source":"Crossref","is-referenced-by-count":10,"title":["Approximation bounds for sparse principal component analysis"],"prefix":"10.1007","volume":"148","author":[{"given":"Alexandre","family":"d\u2019Aspremont","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Francis","family":"Bach","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Laurent El","family":"Ghaoui","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,2,12]]},"reference":[{"issue":"5B","key":"751_CR1","doi-asserted-by":"crossref","first-page":"2877","DOI":"10.1214\/08-AOS664","volume":"37","author":"AA Amini","year":"2009","unstructured":"Amini, A.A., Wainwright, M.: High-dimensional analysis of semidefinite relaxations for sparse principal components. Ann. Stat. 37(5B), 2877\u20132921 (2009)","journal-title":"Ann. Stat."},{"issue":"3","key":"751_CR2","doi-asserted-by":"crossref","first-page":"811","DOI":"10.1137\/S1052623400374756","volume":"12","author":"A Ben-Tal","year":"2002","unstructured":"Ben-Tal, A., Nemirovski, A.: On tractable approximations of uncertain linear matrix inequalities affected by interval uncertainty. SIAM J. Optim. 12(3), 811\u2013833 (2002)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"751_CR3","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1007\/s10107-004-0553-4","volume":"102","author":"A Ben-Tal","year":"2005","unstructured":"Ben-Tal, A., Nemirovski, A.: Non-Euclidean restricted memory level method for large-scale convex optimization. Math. Program. 102(3), 407\u2013456 (2005)","journal-title":"Math. Program."},{"key":"751_CR4","doi-asserted-by":"crossref","unstructured":"Benaych-Georges, F., Guionnet, A., Maida, M.: Fluctuations of the extreme eigenvalues of finite rank deformations of random matrices. Electron. J. Probab. 16(60), 1621\u20131662 (2011), ISSN 1083\u20136489, doi: 10.1214\/EJP.v16-929","DOI":"10.1214\/EJP.v16-929"},{"key":"751_CR5","doi-asserted-by":"crossref","unstructured":"Berthet, Q., Rigollet, P.: Optimal Detection of Sparse Principal Components in High Dimension. Arxiv preprint arXiv:1202.5070 (2012)","DOI":"10.1214\/13-AOS1127"},{"issue":"6","key":"751_CR6","doi-asserted-by":"crossref","first-page":"2313","DOI":"10.1214\/009053606000001523","volume":"35","author":"E Candes","year":"2007","unstructured":"Candes, E., Tao, T.: The Dantzig selector: statistical estimation when p is much larger than n. Ann. Stat. 35(6), 2313\u20132351 (2007)","journal-title":"Ann. Stat."},{"issue":"4","key":"751_CR7","first-page":"63","volume":"6","author":"KL Clarkson","year":"2010","unstructured":"Clarkson, K.L.: Coresets, sparse greedy approximation, and the Frank\u2013Wolfe algorithm. ACM Trans. Algorithms (TALG) 6(4), 63 (2010)","journal-title":"ACM Trans. Algorithms (TALG)"},{"issue":"3","key":"751_CR8","doi-asserted-by":"crossref","first-page":"434","DOI":"10.1137\/050645506","volume":"49","author":"A d\u2019Aspremont","year":"2007","unstructured":"d\u2019Aspremont, A., El Ghaoui, L., Jordan, M.I., Lanckriet, G.R.G.: A direct formulation for sparse PCA using semidefinite programming. SIAM Rev. 49(3), 434\u2013448 (2007)","journal-title":"SIAM Rev."},{"key":"751_CR9","first-page":"1269","volume":"9","author":"A d\u2019Aspremont","year":"2008","unstructured":"d\u2019Aspremont, A., Bach, F., El Ghaoui, L.: Optimal solutions for sparse principal component analysis. J. Mach. Learn. Res. 9, 1269\u20131294 (2008)","journal-title":"J. Mach. Learn. Res."},{"key":"751_CR10","unstructured":"El Ghaoui, L.: On the Quality of a Semidefinite Programming Bound for Sparse Principal Component Analysis. ArXiV math. OC\/0601448 (2006)"},{"key":"751_CR11","doi-asserted-by":"crossref","first-page":"1115","DOI":"10.1145\/227683.227684","volume":"42","author":"MX Goemans","year":"1995","unstructured":"Goemans, M.X., Williamson, D.P.: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J. ACM 42, 1115\u20131145 (1995)","journal-title":"J. ACM"},{"key":"751_CR12","unstructured":"Jaggi, M.: Convex Optimization Without Projection Steps. Arxiv preprint arXiv:1108.1170 (2011)"},{"key":"751_CR13","unstructured":"Journ\u00e9e, M., Bach, F., Absil, P.A., Sepulchre, R.: Low-Rank Optimization for Semidefinite Convex Problems. Arxiv preprint arXiv:0807.4423 (2008)"},{"key":"751_CR14","unstructured":"Journ\u00e9e, M., Nesterov, Y., Richt\u00e1rik, P., Sepulchre, R.: Generalized Power Method for Sparse Principal Component Analysis. arXiv:0811.4724 (2008)"},{"key":"751_CR15","doi-asserted-by":"crossref","DOI":"10.1093\/acprof:oso\/9780198570837.001.0001","volume-title":"Information, Physics, and Computation","author":"M Mezard","year":"2009","unstructured":"Mezard, M., Montanari, A.: Information, Physics, and Computation. Oxford University Press, Oxford (2009)"},{"key":"751_CR16","volume-title":"Spin Glass Theory and Beyond","author":"M Mezard","year":"1987","unstructured":"Mezard, M., Parisi, G., Virasoro, M.A.: Spin Glass Theory and Beyond, vol. 9. World Scientific, Singapore (1987)"},{"issue":"1","key":"751_CR17","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/s10107-004-0552-5","volume":"103","author":"Y Nesterov","year":"2005","unstructured":"Nesterov, Y.: Smooth minimization of non-smooth functions. Math. Program. 103(1), 127\u2013152 (2005)","journal-title":"Math. Program."},{"key":"751_CR18","unstructured":"Papailiopoulos, D.S., Dimakis, A.G., Korokythakis, S.: Sparse PCA Through Low-Rank Approximations. arXiv preprint arXiv:1303.0551 (2013)"},{"key":"751_CR19","doi-asserted-by":"crossref","unstructured":"Spielman, D., Teng, S.H.: Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time. In: Proceedings of the Thirty-Third Annual ACM Symposium on Theory of Computing, pp. 296\u2013305. ACM (2001)","DOI":"10.1145\/380752.380813"},{"key":"751_CR20","volume-title":"Mean Field Models for Spin Glasses: Basic Examples","author":"M Talagrand","year":"2010","unstructured":"Talagrand, M.: Mean Field Models for Spin Glasses: Basic Examples, vol. 1. Springer, Berlin (2010)"},{"key":"751_CR21","doi-asserted-by":"crossref","unstructured":"Zwick, U.: Outward rotations: a tool for rounding solutions of semidefinite programming relaxations, with applications to max cut and other problems. In: Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, pp. 679\u2013687. ACM (1999)","DOI":"10.1145\/301250.301431"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-014-0751-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-014-0751-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-014-0751-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T14:15:18Z","timestamp":1565187318000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-014-0751-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,2,12]]},"references-count":21,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2014,12]]}},"alternative-id":["751"],"URL":"https:\/\/doi.org\/10.1007\/s10107-014-0751-7","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,2,12]]}}}