{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,19]],"date-time":"2026-01-19T14:51:29Z","timestamp":1768834289530,"version":"3.49.0"},"reference-count":73,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Prog. Comp."],"published-print":{"date-parts":[[2019,9]]},"DOI":"10.1007\/s12532-018-0153-6","type":"journal-article","created":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T02:50:11Z","timestamp":1546311011000},"page":"381-420","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":27,"title":["Certifiably optimal sparse principal component analysis"],"prefix":"10.1007","volume":"11","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6617-4447","authenticated-orcid":false,"given":"Lauren","family":"Berk","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1985-1003","authenticated-orcid":false,"given":"Dimitris","family":"Bertsimas","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,1,1]]},"reference":[{"key":"153_CR1","doi-asserted-by":"crossref","unstructured":"Amini, A.A., Wainwright, M.J.: High-dimensional analysis of semidefinite relaxations for sparse principal components. In: IEEE International Symposium on Information Theory, pp. 2454\u20132458. IEEE (2008)","DOI":"10.1109\/ISIT.2008.4595432"},{"key":"153_CR2","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)"},{"issue":"473","key":"153_CR3","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1198\/016214505000000628","volume":"101","author":"E Bair","year":"2006","unstructured":"Bair, E., Hastie, T., Paul, D., Tibshirani, R.: Prediction by supervised principal components. J. Am. Stat. Assoc. 101(473), 119\u2013137 (2006)","journal-title":"J. Am. Stat. Assoc."},{"issue":"1","key":"153_CR4","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/s10957-016-0934-x","volume":"170","author":"A Beck","year":"2016","unstructured":"Beck, A., Vaisbourd, Y.: The sparse principal component analysis problem: optimality conditions and algorithms. J0 Optim. Theory Appl. 170(1), 119\u2013143 (2016)","journal-title":"J0 Optim. Theory Appl."},{"key":"153_CR5","first-page":"1265","volume":"7","author":"KP Bennett","year":"2006","unstructured":"Bennett, K.P., Parrado-Hern\u00e1ndez, E.: The interplay of optimization and machine learning research. J. Mach. Learn. Res. 7, 1265\u20131281 (2006)","journal-title":"J. Mach. Learn. Res."},{"key":"153_CR6","doi-asserted-by":"publisher","first-page":"931","DOI":"10.1016\/j.ejor.2017.03.051","volume":"270","author":"D Bertsimas","year":"2017","unstructured":"Bertsimas, D., Copenhaver, M.S.: Characterization of the equivalence of robustification and regularization in linear and matrix regression. Eur. J. Oper. Res. 270, 931\u2013942 (2017)","journal-title":"Eur. J. Oper. Res."},{"issue":"29","key":"153_CR7","first-page":"1","volume":"18","author":"D Bertsimas","year":"2017","unstructured":"Bertsimas, D., Copenhaver, M.S., Mazumder, R.: Certifiably optimal low rank factor analysis. J. Mach. Learn. Res. 18(29), 1\u201353 (2017)","journal-title":"J. Mach. Learn. Res."},{"issue":"1","key":"153_CR8","first-page":"1","volume":"64","author":"D Bertsimas","year":"2017","unstructured":"Bertsimas, D., Dunn, J.: Optimal classification trees. Mach. Learn. 64(1), 1\u201344 (2017)","journal-title":"Mach. Learn."},{"issue":"1","key":"153_CR9","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1287\/opre.2015.1436","volume":"64","author":"D Bertsimas","year":"2016","unstructured":"Bertsimas, D., King, A.: An algorithmic approach to linear regression. Oper. Res. 64(1), 2\u201316 (2016)","journal-title":"Oper. Res."},{"issue":"2","key":"153_CR10","doi-asserted-by":"publisher","first-page":"813","DOI":"10.1214\/15-AOS1388","volume":"44","author":"D Bertsimas","year":"2016","unstructured":"Bertsimas, D., King, A., Mazumder, R., et al.: Best subset selection via a modern optimization lens. Ann. Stat. 44(2), 813\u2013852 (2016)","journal-title":"Ann. Stat."},{"issue":"2","key":"153_CR11","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1287\/opre.1060.0360","volume":"55","author":"D Bertsimas","year":"2007","unstructured":"Bertsimas, D., Shioda, R.: Classification and regression via integer optimization. Oper. Res. 55(2), 252\u2013271 (2007)","journal-title":"Oper. Res."},{"key":"153_CR12","doi-asserted-by":"crossref","unstructured":"Bixby, R.E.: A brief history of linear and mixed-integer programming computation. Doc. Math. Extra Volume: Optimization Stories, 107\u2013121 (2012)","DOI":"10.4171\/dms\/6\/16"},{"issue":"3","key":"153_CR13","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1145\/1970392.1970395","volume":"58","author":"EJ Cand\u00e8s","year":"2011","unstructured":"Cand\u00e8s, E.J., Li, X., Ma, Y., Wright, J.: Robust principal component analysis? J. ACM 58(3), 11 (2011)","journal-title":"J. ACM"},{"key":"153_CR14","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1016\/j.cor.2013.04.012","volume":"52","author":"E Carrizosa","year":"2014","unstructured":"Carrizosa, E., Guerrero, V.: rs-Sparse principal component analysis: a mixed integer nonlinear programming approach with VNS. Comput. Oper. Res. 52, 349\u2013354 (2014)","journal-title":"Comput. Oper. Res."},{"key":"153_CR15","doi-asserted-by":"publisher","first-page":"1281","DOI":"10.2307\/1912275","volume":"51","author":"G Chamberlain","year":"1983","unstructured":"Chamberlain, G., Rothschild, M.J.: Arbitrage, factor structure, and mean-variance analysis on large asset markets. Econometrica 51, 1281\u20131304 (1983)","journal-title":"Econometrica"},{"key":"153_CR16","unstructured":"Chan, S.O., Papailiopoulos, D., Rubinstein, A.: On the worst-case approximability of sparse PCA. arXiv preprint arXiv:1507.05950 (2015)"},{"issue":"1","key":"153_CR17","first-page":"2213","volume":"15","author":"Y Chen","year":"2014","unstructured":"Chen, Y., Jalali, A., Sanghavi, S., Xu, H.: Clustering partially observed graphs via convex optimization. J. Mach. Learn. Res. 15(1), 2213\u20132238 (2014)","journal-title":"J. Mach. Learn. Res."},{"key":"153_CR18","unstructured":"Computing, J.: Julia micro-benchmarks (2018). https:\/\/julialang.org\/benchmarks\/"},{"key":"153_CR19","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."},{"issue":"3","key":"153_CR20","doi-asserted-by":"publisher","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.: A direct formulation for sparse PCA using semidefinite programming. SIAM Rev. 49(3), 434\u2013448 (2007)","journal-title":"SIAM Rev."},{"issue":"1","key":"153_CR21","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1016\/j.gaitpost.2006.01.007","volume":"25","author":"K Deluzio","year":"2007","unstructured":"Deluzio, K., Astephen, J.: Biomechanical features of gait waveform data associated with knee osteoarthritis: an application of principal component analysis. Gait Posture 25(1), 86\u201393 (2007)","journal-title":"Gait Posture"},{"key":"153_CR22","doi-asserted-by":"publisher","unstructured":"Ding, C., He, X.: K-means clustering via principal component analysis. In: Proceedings of the twenty-first international conference on Machine learning, Banff, Alberta, Canada, 04\u201308 July 2004, p. 29. ACM, New York (2004). https:\/\/doi.org\/10.1145\/1015330.1015408","DOI":"10.1145\/1015330.1015408"},{"issue":"2","key":"153_CR23","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1109\/LGRS.2006.888109","volume":"4","author":"Q Du","year":"2007","unstructured":"Du, Q., Fowler, J.E.: Hyperspectral image compression using jpeg2000 and principal component analysis. IEEE Geosci. Remote Sens. Lett. 4(2), 201\u2013205 (2007)","journal-title":"IEEE Geosci. Remote Sens. Lett."},{"issue":"2","key":"153_CR24","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1137\/15M1020575","volume":"59","author":"I Dunning","year":"2017","unstructured":"Dunning, I., Huchette, J., Lubin, M.: JuMP: a modeling language for mathematical optimization. SIAM Rev. 59(2), 295\u2013320 (2017). https:\/\/doi.org\/10.1137\/15M1020575","journal-title":"SIAM Rev."},{"key":"153_CR25","unstructured":"Gurobi Optimization Inc.: Gurobi 7.0 performance benchmarks. http:\/\/www.gurobi.com\/pdfs\/benchmarks.pdf (2015). Accessed 17 Dec 2016"},{"key":"153_CR26","unstructured":"Gurobi Optimization Inc.: Gurobi optimizer reference manual (2017). http:\/\/www.gurobi.com"},{"key":"153_CR27","doi-asserted-by":"crossref","DOI":"10.1201\/9780429246579","volume-title":"A Handbook of Small Data Sets","author":"DJ Hand","year":"1993","unstructured":"Hand, D.J., Daly, F., McConway, K., Lunn, D., Ostrowski, E.: A Handbook of Small Data Sets, vol. 1. CRC Press, Boca Raton (1993)"},{"key":"153_CR28","doi-asserted-by":"publisher","DOI":"10.1201\/b18401","volume-title":"Statistical Learning with Sparsity: The Lasso and Generalizations","author":"T Hastie","year":"2015","unstructured":"Hastie, T., Tibshirani, R., Wainwright, M.: Statistical Learning with Sparsity: The Lasso and Generalizations. CRC Press, Boca Raton (2015)"},{"key":"153_CR29","unstructured":"Hein, M., B\u00fchler, T.: An inverse power method for nonlinear eigenproblems with applications in 1-spectral clustering and sparse PCA. In: Advances in Neural Information Processing Systems, pp. 847\u2013855 (2010)"},{"issue":"3\/4","key":"153_CR30","doi-asserted-by":"publisher","first-page":"321","DOI":"10.2307\/2333955","volume":"28","author":"H Hotelling","year":"1936","unstructured":"Hotelling, H.: Relations between two sets of variates. Biometrika 28(3\/4), 321\u2013377 (1936)","journal-title":"Biometrika"},{"issue":"3","key":"153_CR31","first-page":"182","volume":"3","author":"YL Hsu","year":"2014","unstructured":"Hsu, Y.L., Huang, P.Y., Chen, D.T.: Sparse principal component analysis in cancer research. Transl. Cancer Res. 3(3), 182 (2014)","journal-title":"Transl. Cancer Res."},{"key":"153_CR32","unstructured":"IBM: IBM ILOG CPLEX User\u2019s manual (2017). https:\/\/www-01.ibm.com\/software\/commerce\/optimization\/cplex-optimizer\/"},{"issue":"4","key":"153_CR33","doi-asserted-by":"publisher","first-page":"334","DOI":"10.21273\/HORTSCI.26.4.334","volume":"26","author":"AF Iezzoni","year":"1991","unstructured":"Iezzoni, A.F., Pritts, M.P.: Applications of principal component analysis to horticultural research. HortScience 26(4), 334\u2013338 (1991)","journal-title":"HortScience"},{"issue":"2","key":"153_CR34","doi-asserted-by":"publisher","first-page":"605","DOI":"10.1007\/s10107-016-1097-0","volume":"165","author":"T Iguchi","year":"2017","unstructured":"Iguchi, T., Mixon, D.G., Peterson, J., Villar, S.: Probably certifiably correct k-means clustering. Math. Program. 165(2), 605\u2013642 (2017)","journal-title":"Math. Program."},{"issue":"3","key":"153_CR35","doi-asserted-by":"publisher","first-page":"225","DOI":"10.2307\/2985919","volume":"16","author":"JN Jeffers","year":"1967","unstructured":"Jeffers, J.N.: Two case studies in the application of principal component analysis. Appl. Stat. 16(3), 225\u2013236 (1967)","journal-title":"Appl. Stat."},{"issue":"1","key":"153_CR36","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1080\/757584395","volume":"22","author":"IT Jolliffe","year":"1995","unstructured":"Jolliffe, I.T.: Rotation of principal components: choice of normalization constraints. J. Appl. Stat. 22(1), 29\u201335 (1995)","journal-title":"J. Appl. Stat."},{"key":"153_CR37","volume-title":"Principal Component Analysis","author":"IT Jolliffe","year":"2002","unstructured":"Jolliffe, I.T.: Principal Component Analysis. Wiley, London (2002)"},{"issue":"3","key":"153_CR38","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."},{"key":"153_CR39","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":"3","key":"153_CR40","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/BF02289233","volume":"23","author":"HF Kaiser","year":"1958","unstructured":"Kaiser, H.F.: The varimax criterion for analytic rotation in factor analysis. Psychometrika 23(3), 187\u2013200 (1958)","journal-title":"Psychometrika"},{"issue":"6","key":"153_CR41","doi-asserted-by":"publisher","first-page":"768","DOI":"10.1109\/TPAMI.1984.4767600","volume":"42","author":"V Kumar","year":"1984","unstructured":"Kumar, V., Kanal, L.N.: Parallel branch-and-bound formulations for and\/or tree search. IEEE Trans. Pattern Anal. Mach. Intell. 42(6), 768\u2013778 (1984)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"1\u20132","key":"153_CR42","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1007\/BF03219975","volume":"61","author":"K Labib","year":"2006","unstructured":"Labib, K., Vemuri, V.R.: An application of principal component analysis to the detection and visualization of computer network attacks. Annales des Telecommunications\/Ann. Telecommun. 61(1\u20132), 218\u2013234 (2006)","journal-title":"Annales des Telecommunications\/Ann. Telecommun."},{"key":"153_CR43","doi-asserted-by":"publisher","first-page":"497","DOI":"10.2307\/1910129","volume":"28","author":"AH Land","year":"1960","unstructured":"Land, A.H., Doig, A.G.: An automatic method of solving discrete programming problems. Econometrica 28, 497\u2013520 (1960)","journal-title":"Econometrica"},{"issue":"4","key":"153_CR44","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1002\/gepi.21621","volume":"36","author":"S Lee","year":"2012","unstructured":"Lee, S., Epstein, M.P., Duncan, R., Lin, X.: Sparse principal component analysis for identifying ancestry-informative markers in genome-wide association studies. Genet. Epidemiol. 36(4), 293\u2013302 (2012)","journal-title":"Genet. Epidemiol."},{"issue":"1","key":"153_CR45","first-page":"933","volume":"22","author":"YK Lee","year":"2012","unstructured":"Lee, Y.K., Lee, E.R., Park, B.U.: Principal component analysis in very high-dimensional spaces. Stat. Sin. 22(1), 933\u2013956 (2012)","journal-title":"Stat. Sin."},{"issue":"1","key":"153_CR46","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1198\/jcgs.2009.0012","volume":"18","author":"C Leng","year":"2009","unstructured":"Leng, C., Wang, H.: On general adaptive sparse principal component analysis. J. Comput. Graph. Stat. 18(1), 201\u2013215 (2009)","journal-title":"J. Comput. Graph. Stat."},{"issue":"6","key":"153_CR47","doi-asserted-by":"publisher","first-page":"568","DOI":"10.1109\/TC.1986.5009434","volume":"100","author":"GJ Li","year":"1986","unstructured":"Li, G.J., Wah, B.W.: Coping with anomalies in parallel branch-and-bound algorithms. IEEE Trans. Comput. 100(6), 568\u2013573 (1986)","journal-title":"IEEE Trans. Comput."},{"key":"153_CR48","unstructured":"Lichman, M.: UCI machine learning repository (2013). http:\/\/archive.ics.uci.edu\/ml"},{"issue":"1","key":"153_CR49","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1147\/rd.471.0057","volume":"47","author":"R Lougee-Heimer","year":"2003","unstructured":"Lougee-Heimer, R.: The common optimization interface for operations research. IBM J. Res. Dev. 47(1), 57\u201366 (2003)","journal-title":"IBM J. Res. Dev."},{"issue":"1","key":"153_CR50","doi-asserted-by":"publisher","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":"2","key":"153_CR51","doi-asserted-by":"publisher","first-page":"772","DOI":"10.1214\/13-AOS1097","volume":"41","author":"Z Ma","year":"2013","unstructured":"Ma, Z., et al.: Sparse principal component analysis and iterative thresholding. Ann. Stat. 41(2), 772\u2013801 (2013)","journal-title":"Ann. Stat."},{"key":"153_CR52","first-page":"1517","volume":"7","author":"OL Mangasarian","year":"2006","unstructured":"Mangasarian, O.L.: Exact 1-norm support vector machines via unconstrained convex differentiable minimization. J. Mach. Learn. Res. 7, 1517\u20131530 (2006)","journal-title":"J. Mach. Learn. Res."},{"key":"153_CR53","unstructured":"Mazumder, R., Radchenko, P., Dedieu, A.: Subset selection with shrinkage: sparse linear modeling when the snr is low. arXiv preprint arXiv:1708.03288 (2017)"},{"key":"153_CR54","unstructured":"Moghaddam, B., Weiss, Y., Avidan, S.: Spectral bounds for sparse PCA: Exact and greedy algorithms. In: Advances in Neural Information Processing Systems, pp. 915\u2013922 (2005)"},{"key":"153_CR55","unstructured":"Nemhauser, G.L.: Integer Programming: the Global Impact. Presented at EURO, INFORMS, Rome, Italy, 2013. http:\/\/euro-informs2013.org\/data\/http_\/euro2013.org\/wp-content\/uploads\/nemhauser.pdf (2013). Accessed 9 Sept 2015"},{"key":"153_CR56","first-page":"747","volume":"3","author":"DS Papailiopoulos","year":"2013","unstructured":"Papailiopoulos, D.S., Dimakis, A.G., Korokythakis, S.: Sparse PCA through low-rank approximations. ICML 3, 747\u2013755 (2013)","journal-title":"ICML"},{"key":"153_CR57","doi-asserted-by":"crossref","unstructured":"Platt, J.C.: Fast training of support vector machines using sequential minimal optimization. In: Advances in Kernel Methods: Support Vector Learning, pp. 185\u2013208. MIT Press, Cambridge (1999)","DOI":"10.7551\/mitpress\/1130.003.0016"},{"issue":"8","key":"153_CR58","doi-asserted-by":"publisher","first-page":"904","DOI":"10.1038\/ng1847","volume":"38","author":"AL Price","year":"2006","unstructured":"Price, A.L., Patterson, N.J., Plenge, R.M., Weinblatt, M.E., Shadick, N.A., Reich, D.: Principal components analysis corrects for stratification in genome-wide association studies. Nat. Genet. 38(8), 904\u2013909 (2006)","journal-title":"Nat. Genet."},{"issue":"3","key":"153_CR59","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1002\/joc.3370060305","volume":"6","author":"MB Richman","year":"1986","unstructured":"Richman, M.B.: Rotation of principal components. J. Climatol. 6(3), 293\u2013335 (1986)","journal-title":"J. Climatol."},{"key":"153_CR60","unstructured":"Richt\u00e1rik, P., Tak\u00e1\u010d, M., Ahipa\u015fao\u011flu, S.D.: Alternating maximization: unifying framework for 8 sparse PCA formulations and efficient parallel codes. arXiv preprint arXiv:1212.4137 (2012)"},{"key":"153_CR61","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/0024-3795(85)90093-X","volume":"65","author":"DS Scott","year":"1985","unstructured":"Scott, D.S.: On the accuracy of the Gerschgorin circle theorem for bounding the spread of a real symmetric matrix. Linear Algebra Appl. 65, 147\u2013155 (1985)","journal-title":"Linear Algebra Appl."},{"key":"153_CR62","first-page":"2960","volume":"25","author":"J Snoek","year":"2012","unstructured":"Snoek, J., Larochelle, H., Adams, R.P.: Practical Bayesian optimization of machine learning algorithms. Adv. Neural Inf. Process. Syst. 25, 2960\u20132968 (2012)","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"153_CR63","volume-title":"Optimization for Machine Learning","author":"S Sra","year":"2012","unstructured":"Sra, S., Nowozin, S., Wright, S.J.: Optimization for Machine Learning. MIT Press, Cambridge (2012)"},{"issue":"1","key":"153_CR64","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 (Methodol.) 58(1), 267\u2013288 (1996)","journal-title":"J. R. Stat. Soc. Ser. B (Methodol.)"},{"key":"153_CR65","unstructured":"Top500 Supercomputer Sites: performance development. http:\/\/www.top500.org\/statistics\/perfdevel\/ (2016). Accessed 17 Dec 2016"},{"key":"153_CR66","volume-title":"The Algebraic Eigenvalue Problem","author":"JH Wilkinson","year":"1965","unstructured":"Wilkinson, J.H.: The Algebraic Eigenvalue Problem, vol. 87. Clarendon Press, Oxford (1965)"},{"issue":"3","key":"153_CR67","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1093\/biostatistics\/kxp008","volume":"10","author":"D Witten","year":"2009","unstructured":"Witten, D., Tibshirani, R., Hastie, T.: A penalized matrix decomposition, with applications to sparse principal components and canonical correlation analysis. Biostatistics 10(3), 515\u2013534 (2009)","journal-title":"Biostatistics"},{"issue":"1","key":"153_CR68","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2202\/1544-6115.1470","volume":"8","author":"DM Witten","year":"2009","unstructured":"Witten, D.M., Tibshirani, R.J.: Extensions of sparse canonical correlation analysis with applications to genomic data. Stat. Appl. Genet. Mol. Biol. 8(1), 1\u201327 (2009)","journal-title":"Stat. Appl. Genet. Mol. Biol."},{"key":"153_CR69","first-page":"1887","volume":"7","author":"C Yanover","year":"2006","unstructured":"Yanover, C., Meltzer, T., Weiss, Y.: Linear programming relaxations and belief propagation\u2014an empirical study. J. Mach. Learn. Res. 7, 1887\u20131907 (2006)","journal-title":"J. Mach. Learn. Res."},{"key":"153_CR70","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, 899\u2013925 (2013)","journal-title":"J. Mach. Learn. Res."},{"key":"153_CR71","unstructured":"Zeng, Z.Q., Yu, H.B., Xu, H.R., Xie, Y.Q., Gao, J.: Fast training support vector machines using parallel sequential minimal optimization. In: 3rd International Conference on Intelligent System and Knowledge Engineering, 2008, vol.\u00a01, pp. 997\u20131001. ISKE 2008. IEEE (2008)"},{"key":"153_CR72","unstructured":"Zhang, Y., Ghaoui, L.E.: Large-scale sparse principal component analysis with application to text data. In: Advances in Neural Information Processing Systems, vol. 24, pp. 532\u2013539 (2011)"},{"issue":"2","key":"153_CR73","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 Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-018-0153-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12532-018-0153-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-018-0153-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,13]],"date-time":"2024-07-13T18:59:20Z","timestamp":1720897160000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12532-018-0153-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,1,1]]},"references-count":73,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2019,9]]}},"alternative-id":["153"],"URL":"https:\/\/doi.org\/10.1007\/s12532-018-0153-6","relation":{},"ISSN":["1867-2949","1867-2957"],"issn-type":[{"value":"1867-2949","type":"print"},{"value":"1867-2957","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,1,1]]},"assertion":[{"value":"18 March 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 November 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 January 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}