{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,14]],"date-time":"2026-07-14T21:37:04Z","timestamp":1784065024541,"version":"3.55.0"},"reference-count":42,"publisher":"Informa UK Limited","issue":"3","funder":[{"DOI":"10.13039\/100007197","name":"USPHS","doi-asserted-by":"publisher","award":["R35 GM141798"],"award-info":[{"award-number":["R35 GM141798"]}],"id":[{"id":"10.13039\/100007197","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100007197","name":"USPHS","doi-asserted-by":"publisher","award":["HG006139"],"award-info":[{"award-number":["HG006139"]}],"id":[{"id":"10.13039\/100007197","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000002","name":"National Institutes of Health","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000002","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["www.tandfonline.com"],"crossmark-restriction":true},"short-container-title":["Journal of Computational and Graphical Statistics"],"published-print":{"date-parts":[[2023,7,3]]},"DOI":"10.1080\/10618600.2022.2146697","type":"journal-article","created":{"date-parts":[[2022,11,14]],"date-time":"2022-11-14T16:48:30Z","timestamp":1668444510000},"page":"1097-1108","update-policy":"https:\/\/doi.org\/10.1080\/tandf_crossmark_01","source":"Crossref","is-referenced-by-count":7,"title":["Algorithms for Sparse Support Vector Machines"],"prefix":"10.1080","volume":"32","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8091-7294","authenticated-orcid":false,"given":"Alfonso","family":"Landeros","sequence":"first","affiliation":[{"name":"Departments of Computational Medicine, University of California","place":["Los Angeles, Los Angeles"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kenneth","family":"Lange","sequence":"additional","affiliation":[{"name":"Departments of Computational Medicine, University of California","place":["Los Angeles, Los Angeles"]},{"name":"Human Genetics, University of California","place":["Los Angeles, Los Angeles"]},{"name":"Statistics, University of California","place":["Los Angeles, Los Angeles"]}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"301","published-online":{"date-parts":[[2022,12,13]]},"reference":[{"key":"e_1_3_2_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-16829-6_12"},{"key":"e_1_3_2_3_1","volume-title":"An Algorithmic Approach to Nonlinear Analysis and Optimization","author":"Beltrami E. J.","year":"1970","unstructured":"Beltrami, E. J. (1970), An Algorithmic Approach to Nonlinear Analysis and Optimization, New York: Academic Press."},{"key":"e_1_3_2_4_1","first-page":"125","article-title":"\u201cSupport Vector Clustering","volume":"2","author":"Ben-Hur A.","year":"2002","unstructured":"Ben-Hur, A., Horn, D., Siegelmann, H. T., and Vapnik, V. (2002), \u201cSupport Vector Clustering,\u201d The Journal of Machine Learning Research, 2, 125\u2013137.","journal-title":"The Journal of Machine Learning Research"},{"key":"e_1_3_2_5_1","first-page":"388","volume-title":"Proceedings of the 13th International Conference on Neural Information Processing Systems, NIPS\u201900","author":"Cauwenberghs G.","year":"2000","unstructured":"Cauwenberghs, G., and Poggio, T. (2000), \u201cIncremental and Decremental Support Vector Machine Learning,\u201d in Proceedings of the 13th International Conference on Neural Information Processing Systems, NIPS\u201900, pp. 388\u2013394, MIT Press."},{"key":"e_1_3_2_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-013-0697-1"},{"key":"e_1_3_2_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00994018"},{"key":"e_1_3_2_8_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9904-1943-07818-4"},{"key":"e_1_3_2_9_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1012454411458"},{"key":"e_1_3_2_10_1","unstructured":"Dua D. and Graff C. (2019) \u201cUCI Machine Learning Repository.\u201d"},{"key":"e_1_3_2_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.sbi.2006.05.006"},{"key":"e_1_3_2_12_1","first-page":"667","article-title":"\u201cSafe Feature Elimination for the Lasso and Sparse Supervised Learning Problems","volume":"8","author":"El Ghaoui L.","year":"2012","unstructured":"El Ghaoui, L., Viallon, V., and Rabbani, T. (2012), \u201cSafe Feature Elimination for the Lasso and Sparse Supervised Learning Problems,\u201d Pacific Journal of Optimization, 8, 667\u2013698.","journal-title":"Pacific Journal of Optimization"},{"key":"e_1_3_2_13_1","first-page":"1871","article-title":"\u201cLIBLINEAR: A Library for Large Linear Classification","volume":"9","author":"Fan R.-E.","year":"2008","unstructured":"Fan, R.-E., Chang, K.-W., Hsieh, C.-J., Wang, X.-R., and Lin, C.-J. (2008), \u201cLIBLINEAR: A Library for Large Linear Classification,\u201d Journal of Machine Learning Research, 9, 1871\u20131874.","journal-title":"Journal of Machine Learning Research"},{"key":"e_1_3_2_14_1","unstructured":"Fan R.-E. Chang K.-W. Hsieh C.-J. Wang X.-R. and Lin C.-J. (1998a) \u201cThe Kernel Adatron With Bias Unit: Analysis of the Algorithm (Part 1) \u201d ACSE Research Report 729 University of Sheffield Department of Automatic Control and Systems Engineering."},{"key":"e_1_3_2_15_1","unstructured":"Fan R.-E. Chang K.-W. Hsieh C.-J. Wang X.-R. and Lin C.-J. (1998b) \u201cThe Kernel Adatron with Bias Unit: Analysis of the Algorithm (Part 2) \u201d ACSE Research Report 728 University of Sheffield Department of Automatic Control and Systems Engineering."},{"key":"e_1_3_2_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11634-008-0020-9"},{"key":"e_1_3_2_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/72.991427"},{"key":"e_1_3_2_18_1","first-page":"1","volume-title":"Regularization, Optimization, Kernels, and Support Vector Machines","author":"Jaggi M.","year":"2014","unstructured":"Jaggi, M. (2014), \u201cAn Equivalence between the Lasso and Support Vector Machines,\u201d in Regularization, Optimization, Kernels, and Support Vector Machines, eds. J. A. K. Suykens, M. Signoretto, A. Argyriou, pp. 1\u201326, New York:. Chapman and Hall\/CRC."},{"key":"e_1_3_2_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0026683"},{"key":"e_1_3_2_20_1","first-page":"1","article-title":"\u201cProximal Distance Algorithms: Theory and Practice","volume":"20","author":"Keys K. L.","year":"2019","unstructured":"Keys, K. L., Zhou, H., and Lange, K. (2019), \u201cProximal Distance Algorithms: Theory and Practice,\u201d Journal of Machine Learning Research, 20, 1\u201338.","journal-title":"Journal of Machine Learning Research"},{"key":"e_1_3_2_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-247X(71)90184-3"},{"key":"e_1_3_2_22_1","first-page":"1","article-title":"\u201cExtensions to the Proximal Distance Method of Constrained Optimization","volume":"23","author":"Landeros A.","year":"2022","unstructured":"Landeros, A., Padilla, O. H. M., Zhou, H., and Lange, K. (2022), \u201cExtensions to the Proximal Distance Method of Constrained Optimization,\u201d Journal of Machine Learning Research, 23, 1\u201345.","journal-title":"Journal of Machine Learning Research"},{"key":"e_1_3_2_23_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974409"},{"key":"e_1_3_2_24_1","doi-asserted-by":"publisher","DOI":"10.1080\/10618600.2000.10474858"},{"key":"e_1_3_2_25_1","doi-asserted-by":"publisher","DOI":"10.1002\/9781118445112.stat08295"},{"key":"e_1_3_2_26_1","doi-asserted-by":"publisher","DOI":"10.1198\/106186008X340940"},{"key":"e_1_3_2_27_1","first-page":"1909","article-title":"\u201cIncremental Support Vector Learning: Analysis, Implementation and Applications","volume":"7","author":"Laskov P.","year":"2006","unstructured":"Laskov, P., Gehl, C., Kr\u00fcger, S., and M\u00fcller, K.-R. (2006), \u201cIncremental Support Vector Learning: Analysis, Implementation and Applications,\u201d Journal of Machine Learning Research, 7, 1909\u20131936.","journal-title":"Journal of Machine Learning Research"},{"key":"e_1_3_2_28_1","volume-title":"Linear and Nonlinear Programming","author":"Luenberger D. G.","year":"1984","unstructured":"Luenberger, D. G. (1984), Linear and Nonlinear Programming, Reading, MA: Addison-Wesley."},{"key":"e_1_3_2_29_1","doi-asserted-by":"publisher","DOI":"10.1162\/15324430152748218"},{"key":"e_1_3_2_30_1","doi-asserted-by":"publisher","DOI":"10.1098\/rsta.1909.0016"},{"key":"e_1_3_2_31_1","first-page":"439","volume-title":"Proceedings of the 2017 Future Technologies Conference","author":"Nguyen H. D.","year":"2017","unstructured":"Nguyen, H. D., and McLachlan, G. J. (2017), \u201cIteratively-Reweighted Least-Squares Fitting of Support Vector Machines: A Majorization\u2013Minimization Algorithm Approach,\u201d in Proceedings of the 2017 Future Technologies Conference, pp. 439\u2013446, The Science and Information Organization."},{"key":"e_1_3_2_32_1","first-page":"1382","volume-title":"Proceedings of the 30th International Conference on Machine Learning","author":"Ogawa K.","year":"2013","unstructured":"Ogawa, K., Suzuki, Y., and Takeuchi, I. (2013), \u201cSafe Screening of Non-Support Vectors in Pathwise SVM Computation,\u201d in Proceedings of the 30th International Conference on Machine Learning, pp. 1382\u20131390, PMLR."},{"key":"e_1_3_2_33_1","first-page":"233","volume-title":"Proceedings of the Human Language Technology Conference of the North American Chapter of the Association for Computational LinguisticsAssociation for Computational Linguistics","author":"Pradhan S.","year":"2004","unstructured":"Pradhan, S., Ward, W., Hacioglu, K., Martin, J. H., and Jurafsky, D. (2004), \u201cShallow Semantic Parsing using Support Vector Machines,\u201d in Proceedings of the Human Language Technology Conference of the North American Chapter of the Association for Computational Linguistics, pp. 233\u2013240, Association for Computational Linguistics."},{"key":"e_1_3_2_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44581-1_27"},{"key":"e_1_3_2_35_1","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/4175.001.0001"},{"key":"e_1_3_2_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/IMSCCS.2007.46"},{"key":"e_1_3_2_37_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-9868.2011.01004.x"},{"key":"e_1_3_2_38_1","first-page":"1","article-title":"\u201cGenSVM: A Generalized Multiclass Support Vector Machine","volume":"17","author":"van den Burg G. J. J.","year":"2016","unstructured":"van den Burg, G. J. J., and Groenen, P. J. F. (2016), \u201cGenSVM: A Generalized Multiclass Support Vector Machine,\u201d Journal of Machine Learning Research, 17, 1\u201342.","journal-title":"Journal of Machine Learning Research"},{"key":"e_1_3_2_39_1","volume-title":"Advances in Neural Information Processing Systems","author":"Wang J.","year":"2013","unstructured":"Wang, J., Zhou, J., Wonka, P., and Ye, J. (2013), \u201cLasso Screening Rules via Dual Polytope Projection,\u201d in Advances in Neural Information Processing Systems (Vol. 26), Curran Associates, Inc."},{"key":"e_1_3_2_40_1","doi-asserted-by":"publisher","DOI":"10.5334\/jors.244"},{"key":"e_1_3_2_41_1","doi-asserted-by":"publisher","DOI":"10.1214\/10-AOAS345"},{"key":"e_1_3_2_42_1","volume-title":"Advances in Neural Information Processing Systems","author":"Xu J.","year":"2017","unstructured":"Xu, J., Chi, E., and Lange, K. (2017), \u201cGeneralized Linear Model Regression under Distance-to-set Penalties,\u201d in Advances in Neural Information Processing Systems (Vol. 30), Curran Associates, Inc."},{"key":"e_1_3_2_43_1","first-page":"49","volume-title":"Proceedings of the 16th International Conference on Neural Information Processing Systems, NIPS\u201903","author":"Zhu J.","year":"2003","unstructured":"Zhu, J., Rosset, S., Hastie, T., and Tibshirani, R. (2003), \u201c1-norm Support Vector Machines,\u201d in Proceedings of the 16th International Conference on Neural Information Processing Systems, NIPS\u201903, pp. 49\u201356. MIT Press."}],"container-title":["Journal of Computational and Graphical Statistics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/10618600.2022.2146697","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,13]],"date-time":"2025-10-13T20:15:33Z","timestamp":1760386533000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.tandfonline.com\/doi\/full\/10.1080\/10618600.2022.2146697"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,12,13]]},"references-count":42,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2023,7,3]]}},"alternative-id":["10.1080\/10618600.2022.2146697"],"URL":"https:\/\/doi.org\/10.1080\/10618600.2022.2146697","relation":{},"ISSN":["1061-8600","1537-2715"],"issn-type":[{"value":"1061-8600","type":"print"},{"value":"1537-2715","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,12,13]]},"assertion":[{"value":"The publishing and review policy for this title is described in its Aims & Scope.","order":1,"name":"peerreview_statement","label":"Peer Review Statement"},{"value":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=ucgs20","URL":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=ucgs20","order":2,"name":"aims_and_scope_url","label":"Aim & Scope"},{"value":"2021-08-14","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2022-11-07","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2022-12-13","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}