{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,21]],"date-time":"2026-05-21T17:25:19Z","timestamp":1779384319148,"version":"3.53.1"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2016,4,18]],"date-time":"2016-04-18T00:00:00Z","timestamp":1460937600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100003977","name":"Israel Science Foundation (IL)","doi-asserted-by":"publisher","award":["253\/12"],"award-info":[{"award-number":["253\/12"]}],"id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Optim Theory Appl"],"published-print":{"date-parts":[[2016,7]]},"DOI":"10.1007\/s10957-016-0934-x","type":"journal-article","created":{"date-parts":[[2016,4,18]],"date-time":"2016-04-18T16:23:35Z","timestamp":1460996615000},"page":"119-143","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":20,"title":["The Sparse Principal Component Analysis Problem: Optimality Conditions and Algorithms"],"prefix":"10.1007","volume":"170","author":[{"given":"Amir","family":"Beck","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yakov","family":"Vaisbourd","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2016,4,18]]},"reference":[{"key":"934_CR1","volume-title":"Principal Component Analysis","author":"IT Jolliffe","year":"2002","unstructured":"Jolliffe, I.T.: Principal Component Analysis, 2nd edn. Springer, New York (2002)","edition":"2"},{"issue":"7","key":"934_CR2","doi-asserted-by":"crossref","first-page":"1112","DOI":"10.1101\/gr.225302","volume":"12","author":"J Misra","year":"2002","unstructured":"Misra, J., Schmitt, W., Hwang, D., Hsiao, L.L., Gullans, S., Stephanopoulos, G., Stephanopoulos, G.: Interactive exploration of microarray gene expression patterns in a reduced dimensional space. Genome Res. 12(7), 1112\u20131120 (2002)","journal-title":"Genome Res."},{"issue":"3","key":"934_CR3","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1080\/14697688.2010.481634","volume":"11","author":"A d\u2019Aspremont","year":"2011","unstructured":"d\u2019Aspremont, A.: Identifying small mean-reverting portfolios. Quant. Finance 11(3), 351\u2013364 (2011)","journal-title":"Quant. Finance"},{"key":"934_CR4","unstructured":"Moghaddam, B., Weiss, Y., Avidan, S.: Spectral bounds for sparse pca: exact and greedy algorithms. In: Y.\u00a0Weiss, B.\u00a0Sch\u00f6lkopf, J.\u00a0Platt (Eds.) Adv. Neural. Inf. Process. Syst. 18, pp. 915\u2013922. MIT Press, Cambridge, MA (2006)"},{"issue":"2","key":"934_CR5","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1080\/757584614","volume":"22","author":"J Cadima","year":"1995","unstructured":"Cadima, J., Jolliffe, I.T.: Loading and correlations in the interpretation of principle compenents. J. Appl. Stat. 22(2), 203\u2013214 (1995)","journal-title":"J. Appl. Stat."},{"key":"934_CR6","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, 1269\u20131294 (2008)","journal-title":"J. Mach. Learn. Res."},{"key":"934_CR7","doi-asserted-by":"crossref","unstructured":"d\u2019Aspremont, A., El Ghaoui, L., Jordan, M., Lanckriet, G.: A direct formulation of sparse PCA using semidefinite programming. SIAM Rev. 49(3), 434\u2013448 (2007)","DOI":"10.1137\/050645506"},{"issue":"3","key":"934_CR8","doi-asserted-by":"crossref","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."},{"key":"934_CR9","doi-asserted-by":"crossref","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. Stat. Soc. Ser. B 58, 267\u2013288 (1996)","journal-title":"J. R. Stat. Soc. Ser. B"},{"key":"934_CR10","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1093\/biostatistics\/kxp008","volume":"10","author":"DM Witten","year":"2009","unstructured":"Witten, D.M., Hastie, T., Tibshirani, R.: A penalized matrix decomposition, with applications to sparse principal components and canonical correlation analysis. Biostatistics 10, 515\u2013534 (2009)","journal-title":"Biostatistics"},{"key":"934_CR11","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, ICML \u201908, pp. 960\u2013967. ACM, NewYork, NY, USA (2008)","DOI":"10.1145\/1390156.1390277"},{"key":"934_CR12","first-page":"2006","volume":"15","author":"H Zou","year":"2004","unstructured":"Zou, H., Hastie, T., Tibshirani, R.: Sparse principal component analysis. J. Comput. Graph. Stat. 15, 2006 (2004)","journal-title":"J. Comput. Graph. Stat."},{"key":"934_CR13","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1111\/j.1467-9868.2005.00503.x","volume":"67","author":"H Zou","year":"2005","unstructured":"Zou, H., Hastie, T.: Regularization and variable selection via the elastic net. J. R. Sta. Soc. Ser. B 67, 301\u2013320 (2005)","journal-title":"J. R. Sta. Soc. Ser. B"},{"issue":"6","key":"934_CR14","doi-asserted-by":"crossref","first-page":"1015","DOI":"10.1016\/j.jmva.2007.06.007","volume":"99","author":"H Shen","year":"2008","unstructured":"Shen, H., Huang, J.Z.: Sparse principal component analysis via regularized low rank matrix approximation. J. Multivar. Anal. 99(6), 1015\u20131034 (2008)","journal-title":"J. Multivar. Anal."},{"key":"934_CR15","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, 517\u2013553 (2010)","journal-title":"J. Mach. Learn. Res."},{"issue":"1","key":"934_CR16","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1137\/110839072","volume":"55","author":"R Luss","year":"2013","unstructured":"Luss, R., Teboulle, M.: Conditional gradient algorithms for rank-one matrix approximations with a sparsity constraint. SIAM Rev. 55(1), 65\u201398 (2013)","journal-title":"SIAM Rev."},{"issue":"1","key":"934_CR17","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s10994-010-5226-3","volume":"85","author":"BK Sriperumbudur","year":"2011","unstructured":"Sriperumbudur, B.K., Torres, D.A., Lanckriet, G.R.: A majorization\u2013minimization approach to the sparse generalized eigenvalue problem. Mach. Learn. 85(1), 3\u201339 (2011)","journal-title":"Mach. Learn."},{"issue":"3","key":"934_CR18","doi-asserted-by":"crossref","first-page":"1480","DOI":"10.1137\/120869778","volume":"23","author":"A Beck","year":"2013","unstructured":"Beck, A., Eldar, Y.C.: Sparsity constrained nonlinear optimization: optimality conditions and algorithms. SIAM J. Opt. 23(3), 1480\u20131509 (2013)","journal-title":"SIAM J. Opt."},{"issue":"1","key":"934_CR19","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1287\/moor.2015.0722","volume":"41","author":"A Beck","year":"2016","unstructured":"Beck, A., Hallak, N.: On the minimization over sparse symmetric sets: projections, optimality conditions, and algorithms. Math. Oper. Res. 41(1), 196\u2013223 (2016)","journal-title":"Math. Oper. Res."},{"key":"934_CR20","doi-asserted-by":"crossref","DOI":"10.1515\/9781400873173","volume-title":"Convex Analysis","author":"R Rockafellar","year":"1970","unstructured":"Rockafellar, R.: Convex Analysis. Princeton Mathematical Series, Princeton University Press, Princeton (1970)"},{"issue":"3","key":"934_CR21","first-page":"225","volume":"16","author":"JNR Jeffers","year":"1967","unstructured":"Jeffers, J.N.R.: Two case studies in the application of principal component analysis. J. R. Stat. Soc. Ser. C. Appl. Stat. 16(3), 225\u2013236 (1967)","journal-title":"J. R. Stat. Soc. Ser. C. Appl. Stat."},{"issue":"1","key":"934_CR22","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1038\/ng765","volume":"30","author":"SA Armstrong","year":"2002","unstructured":"Armstrong, S.A., Staunton, J.E., Silverman, L.B., Pieters, R., den Boer, M.L., Minden, M.D., Sallan, S.E., Lander, E.S., Golub, T.R., Korsmeyer, S.J.: MLL translocations specify a distinct gene expression profile that distinguishes a unique leukemia. Nat. Genet. 30(1), 41\u201347 (2002)","journal-title":"Nat. Genet."},{"issue":"1","key":"934_CR23","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1186\/1471-2105-12-46","volume":"12","author":"F Liu","year":"2011","unstructured":"Liu, F., White, J., Antonescu, C., Gusenleitner, D., Quackenbush, J.: Gcod\u2014genechip oncology database. BMC Bioinform. 12(1), 46 (2011)","journal-title":"BMC Bioinform."}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-016-0934-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10957-016-0934-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-016-0934-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,15]],"date-time":"2024-06-15T20:45:33Z","timestamp":1718484333000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10957-016-0934-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,4,18]]},"references-count":23,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,7]]}},"alternative-id":["934"],"URL":"https:\/\/doi.org\/10.1007\/s10957-016-0934-x","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"value":"0022-3239","type":"print"},{"value":"1573-2878","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,4,18]]}}}