{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,30]],"date-time":"2026-06-30T01:05:07Z","timestamp":1782781507366,"version":"3.54.5"},"reference-count":59,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2017,7,26]],"date-time":"2017-07-26T00:00:00Z","timestamp":1501027200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2018,5]]},"DOI":"10.1007\/s10107-017-1181-0","type":"journal-article","created":{"date-parts":[[2017,7,26]],"date-time":"2017-07-26T16:30:15Z","timestamp":1501086615000},"page":"141-176","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":146,"title":["DC formulations and algorithms for sparse optimization problems"],"prefix":"10.1007","volume":"169","author":[{"given":"Jun-ya","family":"Gotoh","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Akiko","family":"Takeda","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Katsuya","family":"Tono","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2017,7,26]]},"reference":[{"issue":"1","key":"1181_CR1","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1137\/0805002","volume":"5","author":"F Alizadeh","year":"1995","unstructured":"Alizadeh, F.: Interior point methods in semidefinite programming with applications to combinatorial optimization. SIAM J. Optim. 5(1), 13\u201351 (1995)","journal-title":"SIAM J. Optim."},{"key":"1181_CR2","volume-title":"Mathematical Programming in Statistics","author":"TS Arthanari","year":"1981","unstructured":"Arthanari, T.S., Dodge, Y.: Mathematical Programming in Statistics, vol. 341. Wiley, New York (1981)"},{"key":"1181_CR3","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4419-9467-7","volume-title":"Convex Analysis and Monotone Operator Theory in Hilbert Spaces","author":"HH Bauschke","year":"2011","unstructured":"Bauschke, H.H., Combettes, P.L.: Convex Analysis and Monotone Operator Theory in Hilbert Spaces. Springer, Berlin (2011)"},{"issue":"1","key":"1181_CR4","doi-asserted-by":"crossref","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. Imaging Sci. 2(1), 183\u2013202 (2009)","journal-title":"SIAM J. Imaging Sci."},{"issue":"6","key":"1181_CR5","doi-asserted-by":"crossref","first-page":"510","DOI":"10.1016\/j.orl.2003.12.007","volume":"32","author":"D Bertsimas","year":"2004","unstructured":"Bertsimas, D., Pachamanova, D., Sim, M.: Robust linear optimization under general norms. Oper. Res. Lett. 32(6), 510\u2013516 (2004)","journal-title":"Oper. Res. Lett."},{"issue":"2","key":"1181_CR6","doi-asserted-by":"crossref","first-page":"813","DOI":"10.1214\/15-AOS1388","volume":"44","author":"D Bertsimas","year":"2016","unstructured":"Bertsimas, D., King, A., Mazumder, R.: Best subset selection via a modern optimization lens. Ann. Stat. 44(2), 813\u2013852 (2016)","journal-title":"Ann. Stat."},{"key":"1181_CR7","unstructured":"Blake, C.L., Merz, C.J.: UCI repository of machine learning databases, (1998). http:\/\/www.ics.uci.edu\/~mlearn\/MLRepository.html"},{"key":"1181_CR8","doi-asserted-by":"crossref","first-page":"448","DOI":"10.1016\/S0022-0000(73)80033-9","volume":"7","author":"M Blum","year":"1973","unstructured":"Blum, M., Floyd, R.W., Pratt, V., Rivest, R.L., Tarjan, R.E.: Time bounds for selection. J. Comput. Syst. Sci. 7, 448\u2013461 (1973)","journal-title":"J. Comput. Syst. Sci."},{"key":"1181_CR9","unstructured":"Bradley, P.S., Mangasarian, O.L.: Feature selection via concave minimization and support vector machines. In: International Conference on Machine Learning, Volume 98, pp. 82\u201390. (1998)"},{"issue":"30","key":"1181_CR10","doi-asserted-by":"crossref","first-page":"12267","DOI":"10.1073\/pnas.0904287106","volume":"106","author":"J Brodie","year":"2009","unstructured":"Brodie, J., Daubechies, I., De Mol, C., Giannone, D., Loris, I.: Sparse and stable markowitz portfolios. Proc. Natl. Acad. Sci. 106(30), 12267\u201312272 (2009)","journal-title":"Proc. Natl. Acad. Sci."},{"issue":"1","key":"1181_CR11","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1137\/060657704","volume":"51","author":"AM Bruckstein","year":"2009","unstructured":"Bruckstein, A.M., Donoho, D.L., Elad, M.: From sparse solutions of systems of equations to sparse modeling of signals and images. SIAM Rev. 51(1), 34\u201381 (2009)","journal-title":"SIAM Rev."},{"issue":"4","key":"1181_CR12","doi-asserted-by":"crossref","first-page":"1956","DOI":"10.1137\/080738970","volume":"20","author":"J Cai","year":"2010","unstructured":"Cai, J., Candes, E.J., Shen, Z.: A singular value thresholding algorithm for matrix completion. SIAM J. Optim. 20(4), 1956\u20131982 (2010)","journal-title":"SIAM J. Optim."},{"key":"1181_CR13","unstructured":"Cai, X., Nie, F., Huang, H.: Exact top- $$k$$ k feature selection via $$\\ell _{2,0}$$ \u2113 2 , 0 -norm constraint. In: Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence (2013)"},{"issue":"6","key":"1181_CR14","doi-asserted-by":"crossref","first-page":"717","DOI":"10.1007\/s10208-009-9045-5","volume":"9","author":"EJ Cand\u00e8s","year":"2009","unstructured":"Cand\u00e8s, E.J., Recht, B.: Exact matrix completion via convex optimization. Found. Comput. Math. 9(6), 717\u2013772 (2009)","journal-title":"Found. Comput. Math."},{"issue":"12","key":"1181_CR15","doi-asserted-by":"crossref","first-page":"4203","DOI":"10.1109\/TIT.2005.858979","volume":"51","author":"EJ Cand\u00e8s","year":"2005","unstructured":"Cand\u00e8s, E.J., Tao, T.: Decoding by linear programming. IEEE Trans. Inf. Theory 51(12), 4203\u20134215 (2005)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"1181_CR16","doi-asserted-by":"crossref","first-page":"613","DOI":"10.1109\/18.382009","volume":"41","author":"DL Donoho","year":"1995","unstructured":"Donoho, D.L.: De-noising by soft thresholding. IEEE Trans. Inf. Theory 41(3), 613\u2013627 (1995)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"1181_CR17","doi-asserted-by":"crossref","first-page":"1289","DOI":"10.1109\/TIT.2006.871582","volume":"52","author":"DL Donoho","year":"2006","unstructured":"Donoho, D.L.: Compressed sensing. IEEE Trans. Inf. Theory 52(4), 1289\u20131306 (2006)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"456","key":"1181_CR18","doi-asserted-by":"crossref","first-page":"1348","DOI":"10.1198\/016214501753382273","volume":"96","author":"J Fan","year":"2001","unstructured":"Fan, J., Li, R.: Variable selection via nonconcave penalized likelihood and its oracle properties. J. Am. Stat. Assoc. 96(456), 1348\u20131360 (2001)","journal-title":"J. Am. Stat. Assoc."},{"key":"1181_CR19","unstructured":"Gong, P., Zhang, C., Lu, Z., Huang, J., Ye, J.: A general iterative shrinkage and thresholding algorithm for non-convex regularized optimization problems. In: Proceedings of International Conference on Machine Learning Volume 28, pp. 37\u201345. (2013)"},{"issue":"1","key":"1181_CR20","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1007\/s10107-015-0899-9","volume":"156","author":"J Gotoh","year":"2016","unstructured":"Gotoh, J., Uryasev, S.: Two pairs of families of polyhedral norms versus $$\\ell _p$$ \u2113 p -norms: proximity and applications in optimization. Math. Program. 156(1), 391\u2013431 (2016)","journal-title":"Math. Program."},{"issue":"1","key":"1181_CR21","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1080\/02331930903500274","volume":"59","author":"N Gulpinar","year":"2010","unstructured":"Gulpinar, N., Le Thi, H.A., Moeini, M.: Robust investment strategies with discrete asset choice constraints using DC programming. Optimization 59(1), 45\u201362 (2010)","journal-title":"Optimization"},{"key":"1181_CR22","unstructured":"Hempel, A.B., Goulart, P.J.: A novel method for modelling cardinality and rank constraints. In: IEEE Conference on Decision and Control, pp. 4322\u20134327. Los Angeles, USA, December (2014). http:\/\/control.ee.ethz.ch\/index.cgi?page=publications;action=details;id=4712"},{"key":"1181_CR23","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03199-5","volume-title":"Global Optimization: Deterministic Approaches","author":"R Horst","year":"1996","unstructured":"Horst, R., Tuy, H.: Global Optimization: Deterministic Approaches, 3rd edn. Springer-Verlag, Berlin (1996)","edition":"3"},{"issue":"9","key":"1181_CR24","doi-asserted-by":"crossref","first-page":"2117","DOI":"10.1109\/TPAMI.2012.271","volume":"35","author":"Y Hu","year":"2013","unstructured":"Hu, Y., Zhang, D., Ye, J., Li, X., He, X.: Fast and accurate matrix completion via truncated nuclear norm regularization. IEEE Trans. Pattern Anal. Mach. Intell. 35(9), 2117\u20132130 (2013)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"1\u20134","key":"1181_CR25","first-page":"23","volume":"133","author":"HA Thi Le","year":"2005","unstructured":"Le Thi, H.A., Pham Dinh, T.: The DC (difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems. Ann. Oper. Res. 133(1\u20134), 23\u201346 (2005)","journal-title":"Ann. Oper. Res."},{"issue":"1","key":"1181_CR26","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1016\/j.ejor.2014.11.031","volume":"244","author":"HA Thi Le","year":"2015","unstructured":"Le Thi, H.A., Pham Dinh, T.: DC approximation approaches for sparse optimization. Eur. J. Oper. Res. 244(1), 26\u201346 (2015)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"1181_CR27","first-page":"169","volume":"27","author":"HA Le Thi","year":"1999","unstructured":"Le Thi, H.A., Pham Dinh, T., Muu, L.D.: Exact penalty in D.C. programming. Vietnam J. Math. 27(2), 169\u2013178 (1999)","journal-title":"Vietnam J. Math."},{"issue":"3","key":"1181_CR28","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1007\/s11634-008-0030-7","volume":"2","author":"HA Thi Le","year":"2008","unstructured":"Le Thi, H.A., Le, H.M., Nguyen, V.V., Pham Dinh, T.: A DC programming approach for feature selection in support vector machines learning. Adv. Data Anal. Classif. 2(3), 259\u2013278 (2008)","journal-title":"Adv. Data Anal. Classif."},{"issue":"3","key":"1181_CR29","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1007\/s10898-010-9573-1","volume":"49","author":"HA Thi Le","year":"2011","unstructured":"Le Thi, H.A., Pham Dinh, T., Yen, N.D.J.: Properties of two DC algorithms in quadratic programming. J. Glob. Optim. 49(3), 481\u2013495 (2011)","journal-title":"J. Glob. Optim."},{"issue":"3","key":"1181_CR30","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1007\/s10898-011-9765-3","volume":"52","author":"HA Thi Le","year":"2012","unstructured":"Le Thi, H.A., Pham Dinh, T., Ngai, H.V.J.: Exact penalty and error bounds in DC programming. J. Glob. Optim. 52(3), 509\u2013535 (2012)","journal-title":"J. Glob. Optim."},{"key":"1181_CR31","doi-asserted-by":"crossref","unstructured":"Lu, C., Tang, J., Yan, S., Lin, Z.: Generalized nonconvex nonsmooth low-rank minimization. In: Computer Vision and Pattern Recognition (CVPR), 2014 IEEE Conference on, pp. 4130\u20134137. IEEE, (2014)","DOI":"10.1109\/CVPR.2014.526"},{"issue":"1","key":"1181_CR32","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/s10107-009-0306-5","volume":"128","author":"S Ma","year":"2011","unstructured":"Ma, S., Goldfarb, D., Chen, L.: Fixed point and bregman iterative methods for matrix rank minimization. Math. Program. 128(1), 321\u2013353 (2011)","journal-title":"Math. Program."},{"key":"1181_CR33","doi-asserted-by":"crossref","unstructured":"Miyashiro, R., Takano, Y.: Mixed integer second-order cone programming formulations for variable selection in linear regression. Eur. J. Oper. Res. 247(3), 721\u2013731 (2015a)","DOI":"10.1016\/j.ejor.2015.06.081"},{"issue":"1","key":"1181_CR34","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1016\/j.eswa.2014.07.056","volume":"42","author":"R Miyashiro","year":"2015","unstructured":"Miyashiro, R., Takano, Y.: Subset selection by Mallow\u2019s $$C_p$$ C p : a mixed integer programming approach. Expert Syst. Appl. 42(1), 325\u2013331 (2015b)","journal-title":"Expert Syst. Appl."},{"key":"1181_CR35","doi-asserted-by":"crossref","unstructured":"Moghaddam, B., Weiss, Y., Avidan, S.: Generalized spectral bounds for sparse lda. In: Proceedings of the 23rd International Conference on Machine learning, pp. 641\u2013648. ACM, (2006)","DOI":"10.1145\/1143844.1143925"},{"issue":"2","key":"1181_CR36","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1137\/S0097539792240406","volume":"24","author":"BK Natarajan","year":"1995","unstructured":"Natarajan, B.K.: Sparse approximate solutions to linear systems. SIAM J. Comput. 24(2), 227\u2013234 (1995)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"1181_CR37","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/s10107-012-0629-5","volume":"140","author":"Y Nesterov","year":"2013","unstructured":"Nesterov, Y.: Gradient methods for minimizing composite objective function. Math. Program. 140(1), 125\u2013161 (2013)","journal-title":"Math. Program."},{"key":"1181_CR38","doi-asserted-by":"crossref","unstructured":"Nguyen, T.B.T., Le\u00a0Thi, H.A., Le, H.M., Vo, X.T.: DC approximation approach for $$\\ell _0$$ \u2113 0 -minimization in compressed sensing. In: Le Thi, H.A., Nguyen, N.T., Do, T.V. (eds.) Advanced Computational Methods for Knowledge Engineering, pp. 37\u201348. Springer, Berlin (2015)","DOI":"10.1007\/978-3-319-17996-4_4"},{"key":"1181_CR39","unstructured":"Nhat, P.D., Nguyen, M.C., Le\u00a0Thi, H.A.: A DC programming approach for sparse linear discriminant analysis. In: Do, T.V., Le Thi, H.A., Nguyen, N.T. (eds.) Advanced Computational Methods for Knowledge Engineering, pp. 65\u201374. Springer, (2014)"},{"key":"1181_CR40","volume-title":"Numerical Optimization 2nd","author":"Jorge Nocedal","year":"2006","unstructured":"Nocedal, Jorge, Wright, Stephen J.: Numerical Optimization 2nd. Springer, Berlin (2006)"},{"issue":"1\u20133","key":"1181_CR41","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/BF01585173","volume":"62","author":"ML Overton","year":"1993","unstructured":"Overton, M.L., Womersley, R.S.: Optimality conditions and duality theory for minimizing sums of the largest eigenvalues of symmetric matrices. Math. Program. 62(1\u20133), 321\u2013357 (1993)","journal-title":"Math. Program."},{"issue":"7","key":"1181_CR42","doi-asserted-by":"crossref","first-page":"1999","DOI":"10.1007\/s11590-013-0713-7","volume":"8","author":"K Pavlikov","year":"2014","unstructured":"Pavlikov, K., Uryasev, S.: CVaR norm and applications in optimization. Optim. Lett. 8(7), 1999\u20132020 (2014)","journal-title":"Optim. Lett."},{"issue":"1","key":"1181_CR43","first-page":"289","volume":"22","author":"T Pham Dinh","year":"1997","unstructured":"Pham Dinh, T., Le Thi, H.A.: Convex analysis approach to D.C. programming: theory, algorithms and applications. Acta Math. Vietnam. 22(1), 289\u2013355 (1997)","journal-title":"Acta Math. Vietnam."},{"issue":"2","key":"1181_CR44","doi-asserted-by":"crossref","first-page":"476","DOI":"10.1137\/S1052623494274313","volume":"8","author":"T Pham Dinh","year":"1998","unstructured":"Pham Dinh, T., Le Thi, H.A.: A D.C. optimization algorithm for solving the trust-region subproblem. SIAM J. Optim. 8(2), 476\u2013505 (1998)","journal-title":"SIAM J. Optim."},{"key":"1181_CR45","first-page":"1","volume":"8342","author":"T Pham Dinh","year":"2014","unstructured":"Pham Dinh, T., Le Thi, H.A.: Recent advances in DC programming and DCA. Trans. Comput. Collect. Intell. 8342, 1\u201337 (2014)","journal-title":"Trans. Comput. Collect. Intell."},{"issue":"3","key":"1181_CR46","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1137\/070697835","volume":"52","author":"B Recht","year":"2010","unstructured":"Recht, B., Fazel, M., Parrilo, P.A.: Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization. SIAM Rev. 52(3), 471\u2013501 (2010)","journal-title":"SIAM Rev."},{"issue":"17","key":"1181_CR47","doi-asserted-by":"crossref","first-page":"2246","DOI":"10.1093\/bioinformatics\/btg308","volume":"19","author":"SK Shevade","year":"2003","unstructured":"Shevade, S.K., Keerthi, S.S.: A simple and efficient algorithm for gene selection using sparse logistic regression. Bioinformatics 19(17), 2246\u20132253 (2003)","journal-title":"Bioinformatics"},{"key":"1181_CR48","unstructured":"Smola, A.J., Vishwanathan, S.V.N., Hofmann, T.: Kernel methods for missing variables. In: Proceedings of the Tenth International Workshop on Artificial Intelligence and Statistics, pp. 325\u2013332. (2005)"},{"issue":"6","key":"1181_CR49","doi-asserted-by":"crossref","first-page":"1391","DOI":"10.1162\/NECO_a_00283","volume":"24","author":"BK Sriperumbudur","year":"2012","unstructured":"Sriperumbudur, B.K., Lanckriet, G.R.G.: A proof of convergence of the concave-convex procedure using Zangwill\u2019s theory. Neural Comput. 24(6), 1391\u20131407 (2012)","journal-title":"Neural Comput."},{"issue":"1","key":"1181_CR50","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/s10287-012-0158-y","volume":"10","author":"A Takeda","year":"2013","unstructured":"Takeda, A., Niranjan, M., Gotoh, J., Kawahara, Y.: Simultaneous pursuit of out-of-sample performance and sparsity in index tracking portfolios. Comput. Manag. Sci. 10(1), 21\u201349 (2013)","journal-title":"Comput. Manag. Sci."},{"key":"1181_CR51","unstructured":"Thiao, M., Pham\u00a0Dinh, T., Le\u00a0Thi, H.A.: A DC programming approach for sparse eigenvalue problem. In: Proceedings of the 27th International Conference on Machine Learning, pp. 1063\u20131070. (2010)"},{"issue":"1","key":"1181_CR52","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(1), 267\u2013288 (1996)","journal-title":"J. R. Stat. Soc. Ser. B"},{"issue":"3","key":"1181_CR53","first-page":"615","volume":"6","author":"K-C Toh","year":"2010","unstructured":"Toh, K.-C., Yun, S.: An accelerated proximal gradient algorithm for nuclear norm regularized linear least squares problems. Pac. J. Optim. 6(3), 615\u2013640 (2010)","journal-title":"Pac. J. Optim."},{"issue":"3","key":"1181_CR54","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/BF02139472","volume":"2","author":"GA Watson","year":"1992","unstructured":"Watson, G.A.: Linear best approximation using a class of polyhedral norms. Numer. Algorithms 2(3), 321\u2013335 (1992)","journal-title":"Numer. Algorithms"},{"issue":"5","key":"1181_CR55","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/BF02210386","volume":"5","author":"GA Watson","year":"1993","unstructured":"Watson, G.A.: On matrix approximation problems with Ky Fan $$k$$ k norms. Numer. Algorithms 5(5), 263\u2013272 (1993)","journal-title":"Numer. Algorithms"},{"key":"1181_CR56","doi-asserted-by":"crossref","first-page":"766","DOI":"10.1137\/110827144","volume":"24","author":"B Wu","year":"2014","unstructured":"Wu, B., Ding, C., Sun, D.F., Toh, K.-C.: On the Moreau-Yosida regularization of the vector $$k$$ k -norm related functions. SIAM J. Optim. 24, 766\u2013794 (2014)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"1181_CR57","doi-asserted-by":"crossref","first-page":"894","DOI":"10.1214\/09-AOS729","volume":"38","author":"CH Zhang","year":"2010","unstructured":"Zhang, C.H.: Nearly unbiased variable selection under minimax concave penalty. Ann. Stat. 38(2), 894\u2013942 (2010)","journal-title":"Ann. Stat."},{"issue":"1\u20132","key":"1181_CR58","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1007\/s10589-013-9582-3","volume":"59","author":"X Zheng","year":"2014","unstructured":"Zheng, X., Sun, X., Li, D., Sun, J.: Successive convex approximations to cardinality-constrained convex programs: a piecewise-linear DC approach. Comput. Optim. Appl. 59(1\u20132), 379\u2013397 (2014)","journal-title":"Comput. Optim. Appl."},{"issue":"2","key":"1181_CR59","doi-asserted-by":"crossref","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":"http:\/\/link.springer.com\/article\/10.1007\/s10107-017-1181-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-017-1181-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-017-1181-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,25]],"date-time":"2024-06-25T20:14:56Z","timestamp":1719346496000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-017-1181-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,7,26]]},"references-count":59,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,5]]}},"alternative-id":["1181"],"URL":"https:\/\/doi.org\/10.1007\/s10107-017-1181-0","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,7,26]]}}}