{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,26]],"date-time":"2026-06-26T02:36:04Z","timestamp":1782441364959,"version":"3.54.5"},"reference-count":53,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2022,7,19]],"date-time":"2022-07-19T00:00:00Z","timestamp":1658188800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,7,19]],"date-time":"2022-07-19T00:00:00Z","timestamp":1658188800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100000006","name":"Office of Naval Research","doi-asserted-by":"publisher","award":["N000141912323"],"award-info":[{"award-number":["N000141912323"]}],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2023,5]]},"DOI":"10.1007\/s10107-022-01857-w","type":"journal-article","created":{"date-parts":[[2022,7,19]],"date-time":"2022-07-19T15:13:37Z","timestamp":1658243617000},"page":"421-459","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Solving sparse principal component analysis with global support"],"prefix":"10.1007","volume":"199","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0294-8287","authenticated-orcid":false,"given":"Santanu S.","family":"Dey","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Marco","family":"Molinaro","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Guanyi","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,7,19]]},"reference":[{"issue":"6769","key":"1857_CR1","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1038\/35000501","volume":"403","author":"AA Alizadeh","year":"2000","unstructured":"Alizadeh, A.A., Eisen, M.B., Davis, R.E., Ma, C., Lossos, I.S., Rosenwald, A., Boldrick, J.C., Sabet, H., Tran, T., Yu, X., et al.: Distinct types of diffuse large b-cell lymphoma identified by gene expression profiling. Nature 403(6769), 503 (2000)","journal-title":"Nature"},{"issue":"12","key":"1857_CR2","doi-asserted-by":"publisher","first-page":"6745","DOI":"10.1073\/pnas.96.12.6745","volume":"96","author":"U Alon","year":"1999","unstructured":"Alon, U., Barkai, N., Notterman, D.A., Gish, K., Ybarra, S., Mack, D., Levine, A.J.: Broad patterns of gene expression revealed by clustering analysis of tumor and normal colon tissues probed by oligonucleotide arrays. Proc. National Academy Sci. 96(12), 6745\u20136750 (1999)","journal-title":"Proc. National Academy Sci."},{"key":"1857_CR3","unstructured":"Asteris, M., Papailiopoulos, D., Kyrillidis, A., Dimakis, A.G.: Sparse PCA via bipartite matchings. In: Advances in Neural Information Processing Systems, pp. 766\u2013774 (2015)"},{"key":"1857_CR4","doi-asserted-by":"crossref","unstructured":"Asteris, M., Papailiopoulos, D.S., Karystinos, G.N.: Sparse principal component of a rank-deficient matrix. In: 2011 IEEE International Symposium on Information Theory Proceedings, pp. 673\u2013677. IEEE (2011)","DOI":"10.1109\/ISIT.2011.6034216"},{"issue":"2","key":"1857_CR5","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1287\/moor.1100.0449","volume":"35","author":"H Attouch","year":"2010","unstructured":"Attouch, H., Bolte, J., Redont, P., Soubeyran, A.: Proximal alternating minimization and projection methods for nonconvex problems: An approach based on the kurdyka-\u0142ojasiewicz inequality. Math. Oper. Res. 35(2), 438\u2013457 (2010)","journal-title":"Math. Oper. Res."},{"key":"1857_CR6","unstructured":"Berthet, Q., Rigollet, P.: Computational lower bounds for sparse pca. arXiv:1304.0828 (2013)"},{"issue":"1\u20132","key":"1857_CR7","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1007\/s10107-013-0701-9","volume":"146","author":"J Bolte","year":"2014","unstructured":"Bolte, J., Sabach, S., Teboulle, M.: Proximal alternating linearized minimization for nonconvex and nonsmooth problems. Math. Program. 146(1\u20132), 459\u2013494 (2014)","journal-title":"Math. Program."},{"key":"1857_CR8","unstructured":"Boutsidis, C., Drineas, P., Magdon-Ismail, M.: Sparse features for PCA-like linear regression. In: Advances in Neural Information Processing Systems, pp. 2285\u20132293 (2011)"},{"issue":"3","key":"1857_CR9","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1183\/09031936.00175109","volume":"36","author":"PR Burgel","year":"2010","unstructured":"Burgel, P.R., Paillasseur, J., Caillaud, D., Tillie-Leblond, I., Chanez, P., Escamilla, R., Perez, T., Carr\u00e9, P., Roche, N., et al.: Clinical COPD phenotypes: a novel approach using principal component and cluster analyses. Eur. Respiratory J. 36(3), 531\u2013539 (2010)","journal-title":"Eur. Respiratory J."},{"issue":"3\u20134","key":"1857_CR10","doi-asserted-by":"publisher","first-page":"781","DOI":"10.1007\/s00440-014-0562-z","volume":"161","author":"T Cai","year":"2015","unstructured":"Cai, T., Ma, Z., Wu, Y.: Optimal estimation and rank detection for sparse spiked covariance matrices. Probability Theory and Related Fields 161(3\u20134), 781\u2013815 (2015)","journal-title":"Probability Theory and Related Fields"},{"issue":"6","key":"1857_CR11","doi-asserted-by":"publisher","first-page":"3074","DOI":"10.1214\/13-AOS1178","volume":"41","author":"TT Cai","year":"2013","unstructured":"Cai, T.T., Ma, Z., Wu, Y., et al.: Sparse PCA: Optimal rates and adaptive estimation. Ann. Stat. 41(6), 3074\u20133110 (2013)","journal-title":"Ann. Stat."},{"key":"1857_CR12","unstructured":"Chan, S.O., Papailliopoulos, D., Rubinstein, A.: On the approximability of sparse PCA. In: Conference on Learning Theory, pp. 623\u2013646 (2016)"},{"key":"1857_CR13","unstructured":"Chen, S., Ma, S., Xue, L., Zou, H.: An alternating manifold proximal gradient method for sparse PCA and sparse CCA. arXiv:1903.11576 (2019)"},{"issue":"1\u20132","key":"1857_CR14","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/s10107-014-0751-7","volume":"148","author":"A d\u2019Aspremont","year":"2014","unstructured":"d\u2019Aspremont, A., Bach, F., El Ghaoui, L.: Approximation bounds for sparse principal component analysis. Math. Program. 148(1\u20132), 89\u2013110 (2014)","journal-title":"Math. Program."},{"issue":"Jul","key":"1857_CR15","first-page":"1269","volume":"9","author":"A d\u2019Aspremont","year":"2008","unstructured":"d\u2019Aspremont, A., Bach, F., Ghaoui, L.E.: Optimal solutions for sparse principal component analysis. J. Mach. Learn. Res. 9(Jul), 1269\u20131294 (2008)","journal-title":"J. Mach. Learn. Res."},{"key":"1857_CR16","doi-asserted-by":"crossref","unstructured":"d\u2019Aspremont, A., Ghaoui, L.E., Jordan, M.I., Lanckriet, G.R.: A direct formulation for sparse PCA using semidefinite programming. In: Advances in neural information processing systems, pp. 41\u201348 (2005)","DOI":"10.2139\/ssrn.563524"},{"key":"1857_CR17","unstructured":"Del\u00a0Pia, A.: Sparse PCA on fixed-rank matrices. http:\/\/www.optimization-online.org\/DB_HTML\/2019\/07\/7307.html (2019)"},{"issue":"1","key":"1857_CR18","first-page":"4913","volume":"17","author":"Y Deshpande","year":"2016","unstructured":"Deshpande, Y., Montanari, A.: Sparse PCA via covariance thresholding. J. Mach. Learn. Res. 17(1), 4913\u20134953 (2016)","journal-title":"J. Mach. Learn. Res."},{"key":"1857_CR19","unstructured":"Dey, S.S., Mazumder, R., Wang, G.: A convex integer programming approach for optimal sparse pca. arXiv:1810.09062 (2018)"},{"key":"1857_CR20","unstructured":"Erichson, N.B., Zheng, P., Manohar, K., Brunton, S.L., Kutz, J.N., Aravkin, A.Y.: Sparse principal component analysis via variable projection. arXiv:1804.00341 (2018)"},{"key":"1857_CR21","unstructured":"Gallivan, K.A., Absil, P.: Note on the convex hull of the stiefel manifold. Technical note (2010)"},{"key":"1857_CR22","unstructured":"Gu, Q., Wang, Z., Liu, H.: Sparse PCA with oracle property. In: Advances in neural information processing systems, pp. 1529\u20131537 (2014)"},{"key":"1857_CR23","unstructured":"Hiriart-Urruty, J.B., Lemar\u00e9chal, C.: Fundamentals of convex analysis. Springer Science & Business Media (2012)"},{"key":"1857_CR24","unstructured":"Johnstone, I.M., Lu, A.Y.: Sparse principal components analysis. arXiv:0901.4392 (2009)"},{"issue":"2065","key":"1857_CR25","doi-asserted-by":"publisher","first-page":"20150202","DOI":"10.1098\/rsta.2015.0202","volume":"374","author":"IT Jolliffe","year":"2016","unstructured":"Jolliffe, I.T., Cadima, J.: Principal component analysis: a review and recent developments. Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences 374(2065), 20150202 (2016)","journal-title":"Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences"},{"issue":"3","key":"1857_CR26","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1198\/1061860032148","volume":"12","author":"IT Jolliffe","year":"2003","unstructured":"Jolliffe, I.T., Trendafilov, N.T., Uddin, M.: A modified principal component technique based on the LASSO. J. Comput. Graph. Stat. 12(3), 531\u2013547 (2003)","journal-title":"J. Comput. Graph. Stat."},{"issue":"Feb","key":"1857_CR27","first-page":"517","volume":"11","author":"M Journ\u00e9e","year":"2010","unstructured":"Journ\u00e9e, M., Nesterov, Y., Richt\u00e1rik, P., Sepulchre, R.: Generalized power method for sparse principal component analysis. J. Mach. Learn. Res. 11(Feb), 517\u2013553 (2010)","journal-title":"J. Mach. Learn. Res."},{"key":"1857_CR28","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1017\/S0962492917000058","volume":"26","author":"R Kannan","year":"2017","unstructured":"Kannan, R., Vempala, S.: Randomized algorithms in numerical linear algebra. Acta Numerica 26, 95 (2017)","journal-title":"Acta Numerica"},{"key":"1857_CR29","unstructured":"Kim, J., Tawarmalani, M., Richard, J.P.P.: Convexification of permutation-invariant sets and applications. arXiv:1910.02573 (2019)"},{"issue":"3","key":"1857_CR30","doi-asserted-by":"publisher","first-page":"1300","DOI":"10.1214\/15-AOS1310","volume":"43","author":"R Krauthgamer","year":"2015","unstructured":"Krauthgamer, R., Nadler, B., Vilenchik, D., et al.: Do semidefinite relaxations solve sparse PCA up to the information limit? Ann. Stat. 43(3), 1300\u20131322 (2015)","journal-title":"Ann. Stat."},{"issue":"1","key":"1857_CR31","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1214\/14-AOS1273","volume":"43","author":"J Lei","year":"2015","unstructured":"Lei, J., Vu, V.Q., et al.: Sparsistency and agnostic inference in sparse PCA. Ann. Stat. 43(1), 299\u2013322 (2015)","journal-title":"Ann. Stat."},{"issue":"2","key":"1857_CR32","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/s40305-013-0016-9","volume":"1","author":"S Ma","year":"2013","unstructured":"Ma, S.: Alternating direction method of multipliers for sparse principal component analysis. J. Oper. Res. Soc. China 1(2), 253\u2013274 (2013)","journal-title":"J. Oper. Res. Soc. China"},{"key":"1857_CR33","unstructured":"Ma, T., Wigderson, A.: Sum-of-squares lower bounds for sparse pca. In: Advances in Neural Information Processing Systems, pp. 1612\u20131620 (2015)"},{"key":"1857_CR34","unstructured":"Mackey, L.W.: Deflation methods for sparse PCA. In: Advances in neural information processing systems, pp. 1017\u20131024 (2009)"},{"key":"1857_CR35","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/j.ipl.2017.05.008","volume":"126","author":"M Magdon-Ismail","year":"2017","unstructured":"Magdon-Ismail, M.: NP-hardness and inapproximability of sparse PCA. Inf. Process. Lett. 126, 35\u201338 (2017)","journal-title":"Inf. Process. Lett."},{"key":"1857_CR36","unstructured":"Mitzenmacher, M., Upfal, E.: Probability and computing: Randomization and probabilistic techniques in algorithms and data analysis. Cambridge university press (2017)"},{"key":"1857_CR37","unstructured":"Papailiopoulos, D., Dimakis, A., Korokythakis, S.: Sparse PCA through low-rank approximations. In: International Conference on Machine Learning, pp. 747\u2013755 (2013)"},{"key":"1857_CR38","unstructured":"Pietsch, A.: Operator ideals, vol.\u00a016. Deutscher Verlag der Wissenschaften (1978)"},{"key":"1857_CR39","unstructured":"PROBEL, C.J., TROPP, J.A.: Technical report no. 2011-02 august 2011 (2011)"},{"key":"1857_CR40","doi-asserted-by":"crossref","unstructured":"Sigg, C.D., Buhmann, J.M.: Expectation-maximization for sparse and non-negative PCA. In: Proceedings of the 25th international conference on Machine learning, pp. 960\u2013967. ACM (2008)","DOI":"10.1145\/1390156.1390277"},{"key":"1857_CR41","unstructured":"Steinberg, D.: Computation of matrix norms with applications to robust optimization. Research thesis, Technion-Israel University of Technology 2 (2005)"},{"key":"1857_CR42","doi-asserted-by":"crossref","unstructured":"Tropp, J.A.: Column subset selection, matrix factorization, and eigenvalue optimization. In: Proceedings of the twentieth annual ACM-SIAM symposium on Discrete algorithms, pp. 978\u2013986. SIAM (2009)","DOI":"10.1137\/1.9781611973068.106"},{"issue":"4","key":"1857_CR43","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/s10208-011-9099-z","volume":"12","author":"JA Tropp","year":"2012","unstructured":"Tropp, J.A.: User-friendly tail bounds for sums of random matrices. Found. Comput. Math. 12(4), 389\u2013434 (2012)","journal-title":"Found. Comput. Math."},{"key":"1857_CR44","unstructured":"Vu, V., Lei, J.: Minimax rates of estimation for sparse PCA in high dimensions. In: Artificial intelligence and statistics, pp. 1278\u20131286 (2012)"},{"key":"1857_CR45","unstructured":"Vu, V.Q., Cho, J., Lei, J., Rohe, K.: Fantope projection and selection: A near-optimal convex relaxation of sparse PCA. In: Advances in neural information processing systems, pp. 2670\u20132678 (2013)"},{"key":"1857_CR46","unstructured":"Wang, G., Dey, S.: Upper bounds for model-free row-sparse principal component analysis. In: Proceedings of the International Conference on Machine Learning (2020)"},{"key":"1857_CR47","unstructured":"Wang, Z., Lu, H., Liu, H.: Tighten after relax: Minimax-optimal sparse PCA in polynomial time. In: Advances in neural information processing systems, pp. 3383\u20133391 (2014)"},{"key":"1857_CR48","volume-title":"Integer and combinatorial optimization","author":"LA Wolsey","year":"1999","unstructured":"Wolsey, L.A., Nemhauser, G.L.: Integer and combinatorial optimization, vol. 55. Wiley, New york (1999)"},{"issue":"9","key":"1857_CR49","doi-asserted-by":"publisher","first-page":"763","DOI":"10.1093\/bioinformatics\/17.9.763","volume":"17","author":"KY Yeung","year":"2001","unstructured":"Yeung, K.Y., Ruzzo, W.L.: Principal component analysis for clustering gene expression data. Bioinformatics 17(9), 763\u2013774 (2001)","journal-title":"Bioinformatics"},{"key":"1857_CR50","unstructured":"Yongchun\u00a0Li, W.X.: Exact and approximation algorithms for sparse PCA. http:\/\/www.optimization-online.org\/DB_HTML\/2020\/05\/7802.html (2020)"},{"issue":"Apr","key":"1857_CR51","first-page":"899","volume":"14","author":"XT Yuan","year":"2013","unstructured":"Yuan, X.T., Zhang, T.: Truncated power method for sparse eigenvalue problems. J. Mach. Learn. Res. 14(Apr), 899\u2013925 (2013)","journal-title":"J. Mach. Learn. Res."},{"key":"1857_CR52","doi-asserted-by":"crossref","unstructured":"Zhang, Y., d\u2019Aspremont, A., El\u00a0Ghaoui, L.: Sparse PCA: Convex relaxations, algorithms and applications. In: Handbook on Semidefinite, Conic and Polynomial Optimization, pp. 915\u2013940. Springer (2012)","DOI":"10.1007\/978-1-4614-0769-0_31"},{"issue":"2","key":"1857_CR53","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1198\/106186006X113430","volume":"15","author":"H Zou","year":"2006","unstructured":"Zou, H., Hastie, T., Tibshirani, R.: Sparse principal component analysis. J. Comput. Graph. Stat. 15(2), 265\u2013286 (2006)","journal-title":"J. Comput. Graph. Stat."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-022-01857-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10107-022-01857-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-022-01857-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,21]],"date-time":"2023-04-21T17:34:37Z","timestamp":1682098477000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10107-022-01857-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,19]]},"references-count":53,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2023,5]]}},"alternative-id":["1857"],"URL":"https:\/\/doi.org\/10.1007\/s10107-022-01857-w","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,7,19]]},"assertion":[{"value":"21 November 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 May 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 July 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}