{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T15:09:27Z","timestamp":1776784167731,"version":"3.51.2"},"reference-count":71,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2020,2,1]],"date-time":"2020-02-01T00:00:00Z","timestamp":1580515200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,2,1]],"date-time":"2020-02-01T00:00:00Z","timestamp":1580515200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,2,1]],"date-time":"2020-02-01T00:00:00Z","timestamp":1580515200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","award":["2018YJS177"],"award-info":[{"award-number":["2018YJS177"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11431002"],"award-info":[{"award-number":["11431002"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11571033"],"award-info":[{"award-number":["11571033"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Neural Netw. Learning Syst."],"published-print":{"date-parts":[[2020,2]]},"DOI":"10.1109\/tnnls.2019.2905261","type":"journal-article","created":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T22:41:41Z","timestamp":1558478501000},"page":"527-538","source":"Crossref","is-referenced-by-count":31,"title":["Greedy Projected Gradient-Newton Method for Sparse Logistic Regression"],"prefix":"10.1109","volume":"31","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3690-1268","authenticated-orcid":false,"given":"Rui","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Naihua","family":"Xiu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chao","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref71","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-56468-0"},{"key":"ref70","doi-asserted-by":"publisher","DOI":"10.1137\/0904038"},{"key":"ref39","author":"lu","year":"2012","journal-title":"Sequential Convex Programming Methods for A Class of Structured Nonlinear Programming"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-004-5022-1"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.18637\/jss.v033.i01"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-9868.2005.00503.x"},{"key":"ref31","first-page":"401","article-title":"Efficient \n$L_{1}$\n-regularized logistic regression","volume":"1","author":"lee","year":"2006","journal-title":"Proc 21st Nat Conf Artif Intell"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557082"},{"key":"ref37","first-page":"1081","article-title":"Analysis of multi-stage convex relaxation for sparse regularization","volume":"11","author":"zhang","year":"2010","journal-title":"J Mach Learn Res"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1214\/09-AOS729"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/s00041-008-9045-x"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1198\/016214501753382273"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4899-0010-4"},{"key":"ref62","author":"liu","year":"2009","journal-title":"SLEP Sparse Learning with Efficient Projections"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-011-0484-9"},{"key":"ref63","first-page":"1970","article-title":"Local linear convergence of forward–backward under partial smoothness","author":"liang","year":"2014","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref28","first-page":"246","article-title":"Fast, exact model selection and permutation testing for \n$\\ell_{2}$\n-regularized logistic regression","author":"conroy","year":"2012","journal-title":"Proc 15th Int Conf Artif Intell Statist"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1016\/B978-1-55860-377-6.50048-7"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/1273496.1273567"},{"key":"ref65","doi-asserted-by":"crossref","first-page":"3524","DOI":"10.1109\/TNNLS.2017.2731999","article-title":"Rank-k 2-D multinomial logistic regression for matrix data classification","volume":"29","author":"song","year":"2018","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2005.127"},{"key":"ref29","first-page":"713","article-title":"A fast hybrid algorithm for large scale \n$l_{1}$\n-regularized logistic regression","volume":"11","author":"shi","year":"2010","journal-title":"J Mach Learn Res"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1137\/100808071"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.1007\/BF02592073"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.1007\/s101070050047"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TNN.2009.2023654"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TNN.2010.2093537"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1287\/moor.2015.0722"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2012.02.005"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2016.2551724"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2015.2457234"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.jvcir.2012.05.003"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/BTAS.2014.6996222"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2014.2326001"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2245716"},{"key":"ref51","first-page":"325","article-title":"A convergent iterative hard thresholding for nonnegative sparsity optimization","volume":"13","author":"pan","year":"2017","journal-title":"Pacific J Optim"},{"key":"ref59","first-page":"1348","article-title":"A unified framework for high-dimensional analysis of M-estimators with decomposable regularizers","volume":"22","author":"negahban","year":"2009","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref58","first-page":"1935","article-title":"On learning discrete graphical models using greedy methods","volume":"24","author":"jalali","year":"2011","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-013-9161-0"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1007\/s40305-015-0101-3"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2014.525"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1137\/100806278"},{"key":"ref53","first-page":"127","article-title":"Gradient hard thresholding pursuit for sparsity-constrained optimization","author":"yuan","year":"2014","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref52","first-page":"452","article-title":"Group orthogonal matching pursuit for logistic regression","volume":"15","author":"lozano","year":"2011","journal-title":"J Mach Learn Res"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btg308"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2017.2676101"},{"key":"ref40","first-page":"2645","article-title":"Efficient learning with a family of nonconvex regularizers by redistributing nonconvexity","author":"yao","year":"2016","journal-title":"Proc 33rd Int Conf Mach Learn"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btm287"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2016.2547220"},{"key":"ref14","first-page":"807","article-title":"Greedy sparsity-constrained optimization","volume":"14","author":"bahmani","year":"2013","journal-title":"J Mach Learn Res"},{"key":"ref15","first-page":"1519","article-title":"An interior-point method for large-scale \n$\\ell_{1}$\n-regularized logistic regression","volume":"8","author":"koh","year":"2007","journal-title":"J Mach Learn Res"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1023\/A:1012487302797"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2207945"},{"key":"ref18","first-page":"813","article-title":"Best subset selection via a modern optimization lens","volume":"44","author":"bertsimas","year":"2016","journal-title":"Mathematics"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1137\/120869778"},{"key":"ref4","doi-asserted-by":"crossref","first-page":"1609","DOI":"10.1109\/TNNLS.2013.2263427","article-title":"Minimax sparse logistic regression for very high-dimensional feature selection","volume":"24","author":"tan","year":"2013","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"key":"ref3","author":"bishop","year":"2006","journal-title":"Pattern Recognition and Machine Learning"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2016.2550532"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-1742-3"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2016.2514401"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2015.2475618"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2016006"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2018.2851305"},{"key":"ref46","first-page":"1","article-title":"Sparse logistic regression with \n$L_{p}$\n penalty for biomarker identification","volume":"6","author":"liu","year":"2013","journal-title":"Stat Appl Enet Mol Biol"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1186\/1471-2105-14-198"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2010.2042411"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1007\/s00041-008-9035-z"},{"key":"ref42","first-page":"37","article-title":"A general iterative shrinkage and thresholding algorithm for non-convex regularized optimization problems","volume":"28","author":"gong","year":"2013","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2015.2418224"},{"key":"ref44","first-page":"415","article-title":"HONOR: Hybrid optimization for non-convex regularized problems","author":"gong","year":"2015","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref43","first-page":"379","article-title":"Accelerated proximal gradient methods for nonconvex programming","author":"li","year":"2015","journal-title":"Proc Adv Neural Inf Process Syst"}],"container-title":["IEEE Transactions on Neural Networks and Learning Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/5962385\/8984609\/08688642.pdf?arnumber=8688642","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,27]],"date-time":"2022-04-27T17:19:48Z","timestamp":1651079988000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8688642\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,2]]},"references-count":71,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tnnls.2019.2905261","relation":{},"ISSN":["2162-237X","2162-2388"],"issn-type":[{"value":"2162-237X","type":"print"},{"value":"2162-2388","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,2]]}}}