{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T04:19:48Z","timestamp":1745986788103,"version":"3.40.4"},"reference-count":45,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2025,4,17]],"date-time":"2025-04-17T00:00:00Z","timestamp":1744848000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,4,17]],"date-time":"2025-04-17T00:00:00Z","timestamp":1744848000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"Harvard T.H. Chan School of Public Health Education and Research Center","award":["T42 OH008416"],"award-info":[{"award-number":["T42 OH008416"]}]},{"DOI":"10.13039\/100007625","name":"Cure Alzheimer's Fund","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100007625","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000002","name":"National Institutes of Health","doi-asserted-by":"publisher","award":["1R01 AI 154470-01; 2U01 HG 008685; R21 HD 095228 008976; U01 HL 089856; U01 HL 089897; P01 HL 120839; P01 HL 132825; 2U01 HG 008685; R21 HD 095228, P01HL132825"],"award-info":[{"award-number":["1R01 AI 154470-01; 2U01 HG 008685; R21 HD 095228 008976; U01 HL 089856; U01 HL 089897; P01 HL 120839; P01 HL 132825; 2U01 HG 008685; R21 HD 095228, P01HL132825"]}],"id":[{"id":"10.13039\/100000002","id-type":"DOI","asserted-by":"publisher"}]},{"name":"National Science Foundation","award":["NSF PHY 2033046; NSF GRFP 1745302"],"award-info":[{"award-number":["NSF PHY 2033046; NSF GRFP 1745302"]}]},{"name":"NIH Center Grant","award":["P30-ES002109"],"award-info":[{"award-number":["P30-ES002109"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Stat Comput"],"published-print":{"date-parts":[[2025,6]]},"DOI":"10.1007\/s11222-025-10610-0","type":"journal-article","created":{"date-parts":[[2025,4,17]],"date-time":"2025-04-17T12:22:21Z","timestamp":1744892541000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Penalized principal component analysis using smoothing"],"prefix":"10.1007","volume":"35","author":[{"given":"Rebecca","family":"Hurwitz","sequence":"first","affiliation":[]},{"given":"Georg","family":"Hahn","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,4,17]]},"reference":[{"key":"10610_CR1","unstructured":"Baglama, J., Reichel, L., and Lewis, B.: irlba: Fast truncated singular value decomposition and principal components analysis for large dense and sparse matrices. R-package version 2.3.5.1: https:\/\/cran.r-project.org\/package=irlba (2022)"},{"issue":"1","key":"10610_CR2","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1137\/080716542","volume":"2","author":"A Beck","year":"2009","unstructured":"Beck, A., Teboulle, M.: A fast iterative shrinkage-thresholding algorithm for linear inverse problems. SIAM J Imag. Sci. 2(1), 183\u2013202 (2009)","journal-title":"SIAM J Imag. Sci."},{"key":"10610_CR3","unstructured":"Chen, F.: epca: Exploratory principal component analysis. R-package version 1.1.0: https:\/\/cran.r-project.org\/package=epca (2023)"},{"key":"10610_CR4","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/BF01592244","volume":"71","author":"C Chen","year":"1995","unstructured":"Chen, C., Mangasarian, O.: Smoothing methods for convex inequalities and linear complementarity problems. Math. Program. 71, 51\u201369 (1995)","journal-title":"Math. Program."},{"issue":"3","key":"10610_CR5","first-page":"1","volume":"49","author":"A d\u2019Aspremont","year":"2007","unstructured":"d\u2019Aspremont, A., El Ghaoui, L., Jordan, M., Lanckriet, G.: A direct formulation for sparse PCA using semidefinite programming. SIAM Rev. 49(3), 1\u20138 (2007)","journal-title":"SIAM Rev."},{"key":"10610_CR6","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/BF02288367","volume":"1","author":"C Eckart","year":"1936","unstructured":"Eckart, C., Young, G.: The approximation of one matrix by another of lower rank. Psychometrika 1, 211\u20138 (1936)","journal-title":"Psychometrika"},{"issue":"1","key":"10610_CR7","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1002\/gch2.1018","volume":"1","author":"S Elbe","year":"2017","unstructured":"Elbe, S., Buckland-Merrett, G.: Data, disease and diplomacy: GISAID\u2019s innovative contribution to global health. Global Chall. 1(1), 33\u201346 (2017)","journal-title":"Global Chall."},{"key":"10610_CR8","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1016\/j.jmva.2018.09.011","volume":"169","author":"I Gaynanova","year":"2019","unstructured":"Gaynanova, I., Wang, T.: Sparse quadratic classification rules via linear dimension reduction. J. Multivar. Anal. 169, 278\u2013299 (2019)","journal-title":"J. Multivar. Anal."},{"issue":"2","key":"10610_CR9","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1080\/10618600.2016.1172017","volume":"26","author":"I Gaynanova","year":"2017","unstructured":"Gaynanova, I., Booth, J., Wells, M.: Penalized versus constrained generalized eigenvalue problems. J. Comput. Graph. Stat. 26(2), 379\u2013387 (2017)","journal-title":"J. Comput. Graph. Stat."},{"key":"10610_CR10","unstructured":"Golub, G.\u00a0H., van Loan, C.: Matrix Computations. Baltimore: Johns Hopkins University Press, 3rd Edition (1996)"},{"key":"10610_CR11","unstructured":"Guan, L.: $$l_1$$-norm constrained multi-block sparse canonical correlation analysis via proximal gradient descent. arXiv:2201.05289, pages 1\u201360 (2022)"},{"key":"10610_CR12","doi-asserted-by":"crossref","unstructured":"Hahn, G., Lutz, S., Laha, N., Lange, C.: A framework to efficiently smooth L1 penalties for linear regression. bioRxiv:2020.09.17.301788, pages 1\u201335 (2020)","DOI":"10.1101\/2020.09.17.301788"},{"issue":"1","key":"10610_CR13","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1002\/gepi.22356","volume":"45","author":"G Hahn","year":"2021","unstructured":"Hahn, G., Lutz, S., Hecker, J., Prokopenko, D., Cho, M., Silverman, E., Weiss, S., Lange, C.: The NHLBI trans-omics for precision medicine (TOPMed) consortium: locStra: fast analysis of regional\/global stratification in whole-genome sequencing studies. Genet. Epidemiol. 45(1), 82\u201398 (2021)","journal-title":"Genet. Epidemiol."},{"issue":"353","key":"10610_CR14","first-page":"1","volume":"31","author":"G Hahn","year":"2021","unstructured":"Hahn, G., Lutz, S., Laha, N., Cho, M., Silverman, E., Lange, C.: A fast and efficient smoothing approach to LASSO regression and an application in statistical genetics: polygenic risk scores for chronic obstructive pulmonary disease (COPD). Stat. Comput. 31(353), 1\u201311 (2021)","journal-title":"Stat. Comput."},{"key":"10610_CR15","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/j.patcog.2015.07.008","volume":"49","author":"X Han","year":"2016","unstructured":"Han, X., Clemmensen, L.: Regularized generalized eigen-decomposition with applications to sparse supervised feature extraction and sparse discriminant analysis. Pattern Recogn. 49, 43\u201354 (2016)","journal-title":"Pattern Recogn."},{"key":"10610_CR16","doi-asserted-by":"crossref","unstructured":"Hurwitz, R., Hahn, G.: SPEV: Unsmoothed and smoothed penalized PCA using Nesterov smoothing. R-package version 1.0.0: https:\/\/CRAN.R-project.org\/package=SPEV (2023)","DOI":"10.32614\/CRAN.package.SPEV"},{"key":"10610_CR17","first-page":"547","volume":"37","author":"P Jaccard","year":"1901","unstructured":"Jaccard, P.: \u00c9tude comparative de la distribution florale dans une portion des Alpes et des Jura. Bull Soc Vaud Des Sci Nat 37, 547\u2013579 (1901)","journal-title":"Bull Soc Vaud Des Sci Nat"},{"key":"10610_CR18","unstructured":"Journ\u00e9e, M., Nesterov, Y., Richt\u00e1rik, P., Sepulchre, R.: Generalized power method for sparse principal component analysis. arXiv:0811.4724, pages 1\u201330 (2008)"},{"issue":"3","key":"10610_CR19","doi-asserted-by":"publisher","first-page":"710","DOI":"10.1080\/10618600.2019.1568014","volume":"28","author":"S Jung","year":"2019","unstructured":"Jung, S., Ahn, J., Jeon, Y.: Penalized orthogonal iteration for sparse estimation of generalized eigenvalue problem. J. Comput. Graph. Stat. 28(3), 710\u2013721 (2019)","journal-title":"J. Comput. Graph. Stat."},{"issue":"14","key":"10610_CR20","doi-asserted-by":"publisher","first-page":"3059","DOI":"10.1093\/nar\/gkf436","volume":"30","author":"K Katoh","year":"2002","unstructured":"Katoh, K., Misawa, K., Kuma, K., Miyata, T.: MAFFT: a novel method for rapid multiple sequence alignment based on fast Fourier transform. Nucleic Acids Res. 30(14), 3059\u201366 (2002)","journal-title":"Nucleic Acids Res."},{"issue":"3","key":"10610_CR21","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1002\/nla.743","volume":"18","author":"E Kokiopoulou","year":"2011","unstructured":"Kokiopoulou, E., Chen, J., Saad, Y.: Trace optimization and eigenproblems in dimension reduction methods. Num. Linear Algebra Appl. 18(3), 565\u2013602 (2011)","journal-title":"Num. Linear Algebra Appl."},{"issue":"3","key":"10610_CR22","doi-asserted-by":"publisher","first-page":"603","DOI":"10.1093\/biomet\/asm044","volume":"94","author":"L Li","year":"2007","unstructured":"Li, L.: Sparse sufficient dimension reduction. Biometrika 94(3), 603\u2013613 (2007)","journal-title":"Biometrika"},{"key":"10610_CR23","unstructured":"Mackey, L.: Deflation methods for sparse PCA. In: NIPS\u201908: Proceedings of the 22nd international conference on neural information processing systems, pages 1017\u20131024 (2009)"},{"key":"10610_CR24","unstructured":"Maechler, M., Rousseeuw, P., Struyf, A., Hubert, M., Hornik, K., Studer, M., Roudier, P., Gonzalez, J., Kozlowski, K., Schubert, E., Murphy, K.: Cluster: \"finding groups in data\": cluster analysis extended Rousseeuw et al. R-package version 2.1.4: https:\/\/cran.r-project.org\/package=cluster (2022)"},{"key":"10610_CR25","doi-asserted-by":"publisher","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. Ser. A 103, 127\u2013152 (2005)","journal-title":"Math. Program. Ser. A"},{"issue":"9","key":"10610_CR26","doi-asserted-by":"publisher","first-page":"1366","DOI":"10.1093\/bioinformatics\/btv752","volume":"32","author":"D Prokopenko","year":"2016","unstructured":"Prokopenko, D., Hecker, J., Silverman, E., Pagano, M., N\u00f6then, M., Dina, C., Lange, C., Fier, H.: Utilizing the Jaccard index to reveal population stratification in sequencing data: a simulation study and an application to the 1000 genomes Project. Bioinformatics 32(9), 1366\u20131372 (2016)","journal-title":"Bioinformatics"},{"key":"10610_CR27","unstructured":"Purcell, S., Chang, C.: Plink2. www.cog-genomics.org\/plink\/2.0\/. Version 2.0 (2019)"},{"key":"10610_CR28","unstructured":"Qiu, Y., Mei, J., Guennebaud, G., Niesen, J.: RSpectra: solvers for large-scale eigenvalue and SVD problems. R-package version 0.16-1: https:\/\/cran.r-project.org\/package=RSpectra (2022)"},{"key":"10610_CR29","volume-title":"R: A Language and Environment for Statistical Computing","author":"R Core Team","year":"2014","unstructured":"R Core Team: R: A Language and Environment for Statistical Computing. R Foundation for Stat Comp, Vienna, Austria (2014)"},{"issue":"6","key":"10610_CR30","doi-asserted-by":"publisher","first-page":"1015","DOI":"10.1016\/j.jmva.2007.06.007","volume":"99","author":"H Shen","year":"2008","unstructured":"Shen, H., Huang, J.: Sparse principal component analysis via regularized low rank matrix approximation. J. Multivar. Anal. 99(6), 1015\u20131034 (2008)","journal-title":"J. Multivar. Anal."},{"issue":"13","key":"10610_CR31","doi-asserted-by":"publisher","first-page":"30494","DOI":"10.2807\/1560-7917.ES.2017.22.13.30494","volume":"22","author":"Y Shu","year":"2017","unstructured":"Shu, Y., McCauley, J.: GISAID: global initiative on sharing all influenza data-from vision to reality. Euro. Surveill. 22(13), 30494 (2017)","journal-title":"Euro. Surveill."},{"issue":"7","key":"10610_CR32","doi-asserted-by":"publisher","first-page":"1627","DOI":"10.1109\/TSP.2015.2394443","volume":"63","author":"J Song","year":"2015","unstructured":"Song, J., Babu, P., Palomar, D.: Sparse generalized eigenvalue problem via smooth optimization. IEEE Trans. Signal Process. 63(7), 1627\u20131642 (2015)","journal-title":"IEEE Trans. Signal Process."},{"key":"10610_CR33","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10994-010-5226-3","volume":"85","author":"B Sriperumbudur","year":"2011","unstructured":"Sriperumbudur, B., Torres, D., Lanckriet, G.: A majorization-minimization approach to the sparse generalized eigenvalue problem. Mach. Learn. 85, 3\u201339 (2011)","journal-title":"Mach. Learn."},{"key":"10610_CR34","doi-asserted-by":"crossref","unstructured":"Tan, K., Wang, Z., Liu, H., Zhang, T.: Sparse generalized eigenvalue problem: optimal statistical rates via truncated Rayleigh flow. arXiv:1604.08697 pages 1\u201335 (2018)","DOI":"10.1111\/rssb.12291"},{"key":"10610_CR35","unstructured":"The 1000 Genomes Project Consortium (2015). A global reference for human genetic variation. Nature, 526(68-74)"},{"key":"10610_CR36","unstructured":"The 1000 Genomes Project Consortium (2023). The International Genome Sample Resource. https:\/\/www.internationalgenome.org\/"},{"issue":"1","key":"10610_CR37","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1111\/j.2517-6161.1996.tb02080.x","volume":"58","author":"R Tibshirani","year":"1996","unstructured":"Tibshirani, R.: Regression shrinkage and selection via the lasso. J. R. Statist. Soc. B 58(1), 267\u2013288 (1996)","journal-title":"J. R. Statist. Soc. B"},{"key":"10610_CR38","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-76974-1","volume-title":"Multivariate Data Analysis on Matrix Manifolds","author":"N Trendafilov","year":"2021","unstructured":"Trendafilov, N., Gallo, M.: Multivariate Data Analysis on Matrix Manifolds, 1st edn. Springer, New York (2021)","edition":"1"},{"key":"10610_CR39","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1111\/j.1467-9868.2009.00706.x","volume":"71","author":"D Tyler","year":"2009","unstructured":"Tyler, D., Critchley, F., D\u00fcmbgen, L., Oja, H.: Invariant coordinate selection. J. Roy. Stat. Soc. B 71, 549\u2013592 (2009)","journal-title":"J. Roy. Stat. Soc. B"},{"key":"10610_CR40","unstructured":"UC Irvine machine learning repository (1988). Iris. https:\/\/archive.ics.uci.edu\/dataset\/53\/iris"},{"key":"10610_CR41","unstructured":"Varadhan, R.: Alabama: constrained nonlinear optimization. R-package version 2023.1.0: https:\/\/cran.r-project.org\/package=alabama (2023)"},{"issue":"5","key":"10610_CR42","doi-asserted-by":"publisher","first-page":"753","DOI":"10.1111\/j.1467-9868.2011.00783.x","volume":"73","author":"D Witten","year":"2011","unstructured":"Witten, D., Tibshirani, R.: Penalized classification using Fisher\u2019s linear discriminant. J. Roy. Stat. Soc. B 73(5), 753\u2013772 (2011)","journal-title":"J. Roy. Stat. Soc. B"},{"issue":"1","key":"10610_CR43","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1016\/j.ajhg.2010.11.011","volume":"88","author":"J Yang","year":"2011","unstructured":"Yang, J., Lee, S., Goddard, M., Visscher, P.: GCTA: a tool for genome-wide complex trait analysis. Am. J. Hum. Genet. 88(1), 76\u201382 (2011)","journal-title":"Am. J. Hum. Genet."},{"key":"10610_CR44","unstructured":"Zhang, Y., d\u2019Aspremont, A., El\u00a0Ghaoui, L.: Sparse PCA: convex relaxations, algorithms and applications. arXiv:1011.3781, pages 1\u201322 (2010)"},{"key":"10610_CR45","doi-asserted-by":"publisher","first-page":"1148","DOI":"10.1109\/TKDE.2012.47","volume":"25","author":"Z Zhang","year":"2013","unstructured":"Zhang, Z., Chow, T., Zhao, M.: Trace ratio optimization-based semi-supervised nonlinear dimensionality reduction for marginal manifold visualization. IEEE Trans. Knowl. Data Eng. 25, 1148\u20131161 (2013)","journal-title":"IEEE Trans. Knowl. Data Eng."}],"container-title":["Statistics and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11222-025-10610-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11222-025-10610-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11222-025-10610-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,29]],"date-time":"2025-04-29T17:00:35Z","timestamp":1745946035000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11222-025-10610-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,4,17]]},"references-count":45,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,6]]}},"alternative-id":["10610"],"URL":"https:\/\/doi.org\/10.1007\/s11222-025-10610-0","relation":{},"ISSN":["0960-3174","1573-1375"],"issn-type":[{"type":"print","value":"0960-3174"},{"type":"electronic","value":"1573-1375"}],"subject":[],"published":{"date-parts":[[2025,4,17]]},"assertion":[{"value":"15 August 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 March 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 April 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no Conflict of interest to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"80"}}