{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T17:15:53Z","timestamp":1765041353082,"version":"3.37.3"},"reference-count":47,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2022,12,21]],"date-time":"2022-12-21T00:00:00Z","timestamp":1671580800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,12,21]],"date-time":"2022-12-21T00:00:00Z","timestamp":1671580800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100011531","name":"University of Alabama","doi-asserted-by":"publisher","award":["RG14838","RG14678"],"award-info":[{"award-number":["RG14838","RG14678"]}],"id":[{"id":"10.13039\/100011531","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100011531","name":"university of alabama","doi-asserted-by":"publisher","award":["Cyberseed Grant"],"award-info":[{"award-number":["Cyberseed Grant"]}],"id":[{"id":"10.13039\/100011531","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100008982","name":"national science foundation","doi-asserted-by":"publisher","award":["20212554"],"award-info":[{"award-number":["20212554"]}],"id":[{"id":"10.13039\/501100008982","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100008982","name":"National Science Foundation","doi-asserted-by":"publisher","award":["2108645"],"award-info":[{"award-number":["2108645"]}],"id":[{"id":"10.13039\/501100008982","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Adv Data Anal Classif"],"published-print":{"date-parts":[[2023,12]]},"DOI":"10.1007\/s11634-022-00530-6","type":"journal-article","created":{"date-parts":[[2022,12,21]],"date-time":"2022-12-21T14:05:21Z","timestamp":1671631521000},"page":"983-1036","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Proximal methods for sparse optimal scoring and discriminant analysis"],"prefix":"10.1007","volume":"17","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1863-5381","authenticated-orcid":false,"given":"Summer","family":"Atkins","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1326-2339","authenticated-orcid":false,"given":"Gudmundur","family":"Einarsson","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5527-5798","authenticated-orcid":false,"given":"Line","family":"Clemmensen","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0810-7956","authenticated-orcid":false,"given":"Brendan","family":"Ames","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,12,21]]},"reference":[{"key":"530_CR1","doi-asserted-by":"publisher","unstructured":"Allen-Zhu Z, Orecchia L (2017) Linear coupling: an ultimate unification of gradient and mirror descent. In: Papadimitriou CH (ed. 8th Innovations in theoretical computer science conference, ITCS 2017, January 9-11, Berkeley, CA, USA, LIPIcs, vol 67, pp 3:1\u20133:22. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2017). https:\/\/doi.org\/10.4230\/LIPIcs.ITCS.2017.3","DOI":"10.4230\/LIPIcs.ITCS.2017.3"},{"issue":"3","key":"530_CR2","doi-asserted-by":"publisher","first-page":"725","DOI":"10.1007\/s10589-016-9828-y","volume":"64","author":"B Ames","year":"2016","unstructured":"Ames B, Hong M (2016) Alternating direction method of multipliers for penalized zero-variance discriminant analysis. Comput Optim Appl 64(3):725\u2013754. https:\/\/doi.org\/10.1007\/s10589-016-9828-y","journal-title":"Comput Optim Appl"},{"key":"530_CR3","doi-asserted-by":"crossref","unstructured":"Beck A (2017) First-order methods in optimization, vol 25. SIAM","DOI":"10.1137\/1.9781611974997"},{"issue":"1","key":"530_CR4","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1137\/080716542","volume":"2","author":"A Beck","year":"2009","unstructured":"Beck A, Teboulle M (2009) A fast iterative shrinkage-thresholding algorithm for linear inverse problems. SIAM J Imag Sci 2(1):183\u2013202. https:\/\/doi.org\/10.1137\/080716542","journal-title":"SIAM J Imag Sci"},{"issue":"1","key":"530_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1561\/2200000016","volume":"3","author":"S Boyd","year":"2011","unstructured":"Boyd S, Parikh N, Chu E, Peleato B, Eckstein J (2011) Distributed optimization and statistical learning via the alternating direction method of multipliers. Found Trends Mach Learn 3(1):1\u2013122. https:\/\/doi.org\/10.1561\/2200000016","journal-title":"Found Trends Mach Learn"},{"key":"530_CR6","unstructured":"Bubeck S, Lee YT, Singh M (2015) A geometric alternative to Nesterov\u2019s accelerated gradient descent"},{"issue":"496","key":"530_CR7","doi-asserted-by":"publisher","first-page":"1566","DOI":"10.1198\/jasa.2011.tm11199","volume":"106","author":"T Cai","year":"2011","unstructured":"Cai T, Liu W (2011) A direct estimation approach to sparse linear discriminant analysis. J Am Stat Assoc 106(496):1566\u20131577. https:\/\/doi.org\/10.1198\/jasa.2011.tm11199","journal-title":"J Am Stat Assoc"},{"key":"530_CR8","unstructured":"Clemmensen L (2008) Sparse discriminant analysis software (sparseLDA): Matlab and R packages . https:\/\/orbit.dtu.dk\/en\/publications\/sparse-discriminant-analysis-software-sparselda-matlab-and-r-pack\/. Matlab and R versions of the sparseLDA package"},{"issue":"4","key":"530_CR9","doi-asserted-by":"publisher","first-page":"406","DOI":"10.1198\/TECH.2011.08118","volume":"53","author":"L Clemmensen","year":"2011","unstructured":"Clemmensen L, Hastie T, Witten D, Ersb\u00f8ll B (2011) Sparse discriminant analysis. Technometrics 53(4):406\u2013413. https:\/\/doi.org\/10.1198\/TECH.2011.08118","journal-title":"Technometrics"},{"issue":"6","key":"530_CR10","doi-asserted-by":"publisher","first-page":"1293","DOI":"10.1109\/jas.2019.1911747","volume":"6","author":"HA Dau","year":"2019","unstructured":"Dau HA, Bagnall AJ, Kamgar K, Yeh CM, Zhu Y, Gharghabi S, Ratanamahatana CA, Keogh EJ (2019) The UCR time series archive. IEEE CAA J Autom Sinica 6(6):1293\u20131305. https:\/\/doi.org\/10.1109\/jas.2019.1911747","journal-title":"IEEE CAA J Autom Sinica"},{"key":"530_CR11","doi-asserted-by":"crossref","unstructured":"Dau HA, Keogh E, Kamgar K, Yeh CCM, Zhu Y, Gharghabi S, Ratanamahatana CA, Yanping Hu B, Begum N, Bagnall A, Mueen A, Batista G (2018) The UCR time series classification archive. https:\/\/www.cs.ucr.edu\/~eamonn\/time_series_data_2018\/","DOI":"10.1109\/JAS.2019.1911747"},{"issue":"66","key":"530_CR12","doi-asserted-by":"publisher","first-page":"889","DOI":"10.1007\/s10915-015-0048-x","volume":"3","author":"W Deng","year":"2012","unstructured":"Deng W, Yin W (2012) On the global and linear convergence of the generalized alternating direction method of multipliers. J Sci Comput 3(66):889\u2013916. https:\/\/doi.org\/10.1007\/s10915-015-0048-x","journal-title":"J Sci Comput"},{"issue":"2","key":"530_CR13","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1214\/009053604000000067","volume":"32","author":"B Efron","year":"2004","unstructured":"Efron B, Hastie T, Johnstone I, Tibshirani R (2004) Least angle regression. Ann Stat 32(2):407\u2013499","journal-title":"Ann Stat"},{"key":"530_CR14","doi-asserted-by":"crossref","unstructured":"Einarsson G, Clemmensen L, Ames B, Atkins S (2017) Accsda: accelerated sparse discriminant analysis. https:\/\/cran.r-project.org\/web\/packages\/accSDA\/index.html. Also available at https:\/\/github.com\/gumeo\/accSDA","DOI":"10.32614\/CRAN.package.accSDA"},{"key":"530_CR15","doi-asserted-by":"crossref","unstructured":"Einarsson G, Jensen JN, Paulsen RR, Einarsdottir H, Ersb\u00f8ll BK, Dahl AB, Christensen LB (2017) Foreign object detection in multispectral x-ray images of food items using sparse discriminant analysis. In: Scandinavian conference on image analysis, pp 350\u2013361. Springer","DOI":"10.1007\/978-3-319-59126-1_29"},{"issue":"6","key":"530_CR16","doi-asserted-by":"publisher","first-page":"2605","DOI":"10.1214\/07-AOS504","volume":"36","author":"J Fan","year":"2008","unstructured":"Fan J, Fan Y (2008) High dimensional classification using features annealed independence rules. Ann Stat 36(6):2605\u20132637. https:\/\/doi.org\/10.1214\/07-AOS504","journal-title":"Ann Stat"},{"key":"530_CR17","unstructured":"Flammarion N, Bach F (2015) From averaging to acceleration, there is only a step-size. In: Conference on learning theory, pp 658\u2013695. PMLR"},{"issue":"1","key":"530_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.18637\/jss.v033.i01","volume":"33","author":"J Friedman","year":"2010","unstructured":"Friedman J, Hastie T, Tibshirani R (2010) Regularization paths for generalized linear models via coordinate descent. J Stat Softw 33(1):1","journal-title":"J Stat Softw"},{"issue":"1","key":"530_CR19","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/s10107-012-0530-2","volume":"141","author":"D Goldfarb","year":"2013","unstructured":"Goldfarb D, Ma S, Scheinberg K (2013) Fast alternating linearization methods for minimizing the sum of two convex functions. Math Program 141(1):349\u2013382","journal-title":"Math Program"},{"key":"530_CR20","doi-asserted-by":"publisher","DOI":"10.56021\/9781421407944","volume-title":"Matrix computations","author":"GH Golub","year":"2013","unstructured":"Golub GH, Van Loan CF (2013) Matrix computations, 4th edn. The Johns Hopkins University Press, Baltimore","edition":"4"},{"issue":"6","key":"530_CR21","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1109\/TNSRE.2008.926701","volume":"16","author":"L Grosenick","year":"2008","unstructured":"Grosenick L, Greer S, Knutson B (2008) Interpretable classifiers for fmri improve prediction of purchases. IEEE Trans Neural Syst Rehabil Eng 16(6):539\u2013548","journal-title":"IEEE Trans Neural Syst Rehabil Eng"},{"key":"530_CR22","doi-asserted-by":"crossref","unstructured":"Hastie T, Buja A, Tibshirani R (1995) Penalized discriminant analysis. Ann Stat pp 73\u2013102","DOI":"10.1214\/aos\/1176324456"},{"issue":"428","key":"530_CR23","doi-asserted-by":"publisher","first-page":"1255","DOI":"10.2307\/2290989","volume":"89","author":"T Hastie","year":"1994","unstructured":"Hastie T, Tibshirani R, Buja A (1994) Flexible discriminant analysis by optimal scoring. J Am Stat Assoc 89(428):1255\u20131270. https:\/\/doi.org\/10.2307\/2290989","journal-title":"J Am Stat Assoc"},{"key":"530_CR24","volume-title":"The elements of statistical learning","author":"T Hastie","year":"2013","unstructured":"Hastie T, Tibshirani R, Friedman JH (2013) The elements of statistical learning, 2nd edn. Springer, New York","edition":"2"},{"key":"530_CR25","volume-title":"Statistical learning with sparsity: the lasso and generalizations","author":"T Hastie","year":"2012","unstructured":"Hastie T, Tibshirani R, Wainwright M (2012) Statistical learning with sparsity: the lasso and generalizations, 1st edn. CRC Press, Boca Raton","edition":"1"},{"issue":"2","key":"530_CR26","doi-asserted-by":"publisher","first-page":"700","DOI":"10.1137\/110836936","volume":"50","author":"B He","year":"2012","unstructured":"He B, Yuan X (2012) On the $${O}(1\/n)$$ convergence rate of the Douglas-Rachford alternating direction method. SIAM J Numer Anal 50(2):700\u2013709","journal-title":"SIAM J Numer Anal"},{"issue":"1","key":"530_CR27","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1137\/15M1009597","volume":"26","author":"L Lessard","year":"2016","unstructured":"Lessard L, Recht B, Packard A (2016) Analysis and design of optimization algorithms via integral quadratic constraints. SIAM J Optim 26(1):57\u201395. https:\/\/doi.org\/10.1137\/15M1009597","journal-title":"SIAM J Optim"},{"key":"530_CR28","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1093\/biomet\/asr066","volume":"99","author":"Q Ma","year":"2012","unstructured":"Ma Q, Yuan M, Zou H (2012) A direct approach to sparse discriminant analysis in ultra-high dimensions. Biometrika 99:29\u201342. https:\/\/doi.org\/10.1093\/biomet\/asr066","journal-title":"Biometrika"},{"issue":"1","key":"530_CR29","first-page":"97","volume":"29","author":"Q Mai","year":"2019","unstructured":"Mai Q, Yang Y, Zou H (2019) Multiclass sparse discriminant analysis. Stat Sin 29(1):97\u2013111","journal-title":"Stat Sin"},{"issue":"2","key":"530_CR30","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1080\/00401706.2012.746208","volume":"55","author":"Q Mai","year":"2013","unstructured":"Mai Q, Zou H (2013) A note on the connection and equivalence of three sparse linear discriminant analysis methods. Technometrics 55(2):243\u2013246. https:\/\/doi.org\/10.1080\/00401706.2012.746208","journal-title":"Technometrics"},{"key":"530_CR31","volume-title":"Spatial variation","author":"B Mat\u00e9rn","year":"2013","unstructured":"Mat\u00e9rn B (2013) Spatial variation, vol 36. Springer Science & Business Media, New York"},{"key":"530_CR32","unstructured":"Merchante LFS, Grandvalet Y, Govaert G (2012) An efficient approach to sparse linear discriminant analysis. In: Proceedings of the 29th international conference on machine learning, ICML 2012, Edinburgh, Scotland, UK, June 26 - July 1, 2012. icml.cc \/ Omnipress. http:\/\/icml.cc\/2012\/papers\/591.pdf"},{"key":"530_CR33","unstructured":"Nesterov Y (1983) A method of solving a convex programming problem with convergence rate $${O}(1\/k^2)$$. In: Soviet mathematics doklady, vol\u00a027, pp 372\u2013376. http:\/\/mpawankumar.info\/teaching\/cdt-big-data\/nesterov83.pdf"},{"issue":"1","key":"530_CR34","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/s10107-004-0552-5","volume":"103","author":"Y Nesterov","year":"2005","unstructured":"Nesterov Y (2005) Smooth minimization of non-smooth functions. Math Program 103(1):127\u2013152. https:\/\/doi.org\/10.1007\/s10107-004-0552-5","journal-title":"Math Program"},{"issue":"1","key":"530_CR35","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s10107-012-0629-5","volume":"140","author":"Y Nesterov","year":"2013","unstructured":"Nesterov Y (2013) Gradient methods for minimizing composite functions. Math Program 140(1):125\u2013161. https:\/\/doi.org\/10.1007\/s10107-012-0629-5","journal-title":"Math Program"},{"key":"530_CR36","unstructured":"Nishihara R, Lessard L, Recht B, Packard A, Jordan M (2015) A general analysis of the convergence of ADMM. In: International conference on machine learning, pp 343\u2013352. PMLR"},{"key":"530_CR37","volume-title":"Numerical optimization","author":"J Nocedal","year":"2006","unstructured":"Nocedal J, Wright S (2006) Numerical optimization, 2nd edn. Springer Science & Business Media, New York","edition":"2"},{"issue":"3","key":"530_CR38","doi-asserted-by":"publisher","first-page":"715","DOI":"10.1007\/s10208-013-9150-3","volume":"15","author":"B O\u2019Donoghue","year":"2015","unstructured":"O\u2019Donoghue B, Candes E (2015) Adaptive restart for accelerated gradient schemes. Found Comput Math 15(3):715\u2013732. https:\/\/doi.org\/10.1007\/s10208-013-9150-3","journal-title":"Found Comput Math"},{"issue":"3","key":"530_CR39","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1561\/2400000003","volume":"1","author":"N Parikh","year":"2014","unstructured":"Parikh N, Boyd SP (2014) Proximal algorithms. Found Trends Optim 1(3):127\u2013239. https:\/\/doi.org\/10.1561\/2400000003","journal-title":"Found Trends Optim"},{"key":"530_CR40","doi-asserted-by":"crossref","unstructured":"Roth V, Fischer B (2008) The group-lasso for generalized linear models: uniqueness of solutions and efficient algorithms. In: Proceedings of the 25th international conference on machine learning, pp 848\u2013855","DOI":"10.1145\/1390156.1390263"},{"issue":"2","key":"530_CR41","doi-asserted-by":"publisher","first-page":"1241","DOI":"10.1214\/10-AOS870","volume":"39","author":"J Shao","year":"2011","unstructured":"Shao J, Wang Y, Deng X, Wang S (2011) Sparse linear discriminant analysis by thresholding for high dimensional data. Ann Stat 39(2):1241\u20131265. https:\/\/doi.org\/10.1214\/10-AOS870","journal-title":"Ann Stat"},{"key":"530_CR42","unstructured":"Su W, Boyd S, Candes E (2014) A differential equation for modeling Nesterov\u2019s accelerated gradient method: Theory and insights. In: Advances in neural information processing systems, pp 2510\u20132518"},{"key":"530_CR43","doi-asserted-by":"publisher","DOI":"10.1214\/ss\/1056397488","author":"R Tibshirani","year":"2003","unstructured":"Tibshirani R, Hastie T, Narasimhan B, Chu G (2003) Class prediction by nearest shrunken centroids, with applications to DNA microarrays. Stat Sci. https:\/\/doi.org\/10.1214\/ss\/1056397488","journal-title":"Stat Sci"},{"key":"530_CR44","unstructured":"Tseng P (2008) On accelerated proximal gradient methods for convex-concave optimization. submitted to SIAM Journal on Optimization 2(3). http:\/\/www.mit.edu\/~dimitrib\/PTseng\/papers\/apgm.pdf"},{"issue":"5","key":"530_CR45","doi-asserted-by":"publisher","first-page":"753","DOI":"10.1111\/j.1467-9868.2011.00783.x","volume":"73","author":"DM Witten","year":"2011","unstructured":"Witten DM, Tibshirani R (2011) Penalized classification using Fisher\u2019s linear discriminant. J R Stat Soc Ser B 73(5):753\u2013772. https:\/\/doi.org\/10.1111\/j.1467-9868.2011.00783.x","journal-title":"J R Stat Soc Ser B"},{"issue":"9","key":"530_CR46","doi-asserted-by":"publisher","first-page":"1145","DOI":"10.1093\/bioinformatics\/btp019","volume":"25","author":"M Wu","year":"2008","unstructured":"Wu M, Zhang L, Wang Z, Christiani D, Lin X (2008) Sparse linear discriminant analysis for simultaneous testing for the significance of a gene set\/pathway and gene selection. Bioinformatics 25(9):1145\u20131151. https:\/\/doi.org\/10.1093\/bioinformatics\/btp019","journal-title":"Bioinformatics"},{"issue":"2","key":"530_CR47","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1111\/j.1467-9868.2005.00503.x","volume":"67","author":"H Zou","year":"2005","unstructured":"Zou H, Hastie T (2005) Regularization and variable selection via the elastic net. J R Stat Soc Ser B 67(2):301\u2013320. https:\/\/doi.org\/10.1111\/j.1467-9868.2005.00503.x","journal-title":"J R Stat Soc Ser B"}],"container-title":["Advances in Data Analysis and Classification"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11634-022-00530-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11634-022-00530-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11634-022-00530-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,10]],"date-time":"2024-10-10T21:03:42Z","timestamp":1728594222000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11634-022-00530-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,12,21]]},"references-count":47,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2023,12]]}},"alternative-id":["530"],"URL":"https:\/\/doi.org\/10.1007\/s11634-022-00530-6","relation":{},"ISSN":["1862-5347","1862-5355"],"issn-type":[{"type":"print","value":"1862-5347"},{"type":"electronic","value":"1862-5355"}],"subject":[],"published":{"date-parts":[[2022,12,21]]},"assertion":[{"value":"18 September 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 September 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 November 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 December 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}