{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,26]],"date-time":"2026-03-26T14:33:44Z","timestamp":1774535624684,"version":"3.50.1"},"reference-count":47,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"12","license":[{"start":{"date-parts":[[2018,6,15]],"date-time":"2018-06-15T00:00:00Z","timestamp":1529020800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61531166005"],"award-info":[{"award-number":["61531166005"]}],"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":["61571263"],"award-info":[{"award-number":["61571263"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012166","name":"National Basic Research Program of China","doi-asserted-by":"publisher","award":["2016YFE0201900"],"award-info":[{"award-number":["2016YFE0201900"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012166","name":"National Basic Research Program of China","doi-asserted-by":"publisher","award":["2017YFC0403600"],"award-info":[{"award-number":["2017YFC0403600"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Tsinghua University Initiative Scientific Research Program","award":["2014Z01005"],"award-info":[{"award-number":["2014Z01005"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Signal Process."],"published-print":{"date-parts":[[2018,6,15]]},"DOI":"10.1109\/tsp.2018.2824289","type":"journal-article","created":{"date-parts":[[2018,4,6]],"date-time":"2018-04-06T18:30:35Z","timestamp":1523039435000},"page":"3199-3211","source":"Crossref","is-referenced-by-count":29,"title":["Nonconvex Sparse Logistic Regression With Weakly Convex Regularization"],"prefix":"10.1109","volume":"66","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7760-0897","authenticated-orcid":false,"given":"Xinyue","family":"Shen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8427-1021","authenticated-orcid":false,"given":"Yuantao","family":"Gu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","article-title":"A fixed-point continuation method for L1-regularized minimization with applications to compressed sensing","author":"hale","year":"2007"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1137\/080716542"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1287\/moor.8.2.231"},{"key":"ref32","first-page":"1275","article-title":"Fast sparse recovery via nonconvex optimization","author":"chen","year":"0","journal-title":"Proc IEEE Global Conf Signal Inf Process"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2438302"},{"key":"ref30","first-page":"3350","article-title":"The convergence guarantees of a nonconvex approach for sparse recovery using regularized least squares","author":"chen","year":"0","journal-title":"Proc IEEE Int Conf Acoust Speech Signal Process"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-012-0629-5"},{"key":"ref36","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/s10479-004-5022-1","article-title":"The DC (difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems","volume":"133","author":"hoai","year":"2005","journal-title":"Ann Operations Res"},{"key":"ref35","first-page":"855","article-title":"Waveshrink with firm shrinkage","volume":"7","author":"gao","year":"1997","journal-title":"Statist Sinica"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1214\/09-AOS729"},{"key":"ref10","first-page":"1660","article-title":"A comparison of numerical optimizers for logistic regression","volume":"125","author":"minka","year":"2007","journal-title":"J Amer Chem Soc"},{"key":"ref40","first-page":"372","article-title":"A method for solving the convex programming problem with convergence rate ${O}(1\/k^{2})$","volume":"27","author":"nesterov","year":"1983","journal-title":"Soviet Math Dokl"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TNN.2003.809398"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btg308"},{"key":"ref13","first-page":"401","article-title":"Efficient L1 regularized logistic regression","author":"lee","year":"0","journal-title":"Proc Amer Assoc Artif Intell"},{"key":"ref14","first-page":"1519","article-title":"An interior-point method for large-scale L1-regularized logistic regression","volume":"8","author":"koh","year":"2007","journal-title":"J Mach Learn Res"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2207945"},{"key":"ref16","first-page":"476","article-title":"Regularized M-estimators with nonconvexity: Statistical and algorithmic theory for local optima","author":"loh","year":"0","journal-title":"Proc Adv Neur Inf Process Syst"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-016-0758-2"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2007.898300"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2014.2330349"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/CISS.2008.4558487"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1021\/ci025501d"},{"key":"ref27","doi-asserted-by":"crossref","first-page":"830","DOI":"10.1080\/10556788.2011.652630","article-title":"Learning sparse classifiers with difference of convex functions algorithms","volume":"28","author":"cheng","year":"2013","journal-title":"Optimization Methods Softw"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btl386"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/s11042-013-1766-4"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.871582"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1167\/11.5.2"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/0378-3758(89)90004-9"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-21606-5"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1093\/biostatistics\/kxg046"},{"key":"ref9","article-title":"Logistic regression for data mining and high-dimensional classification","author":"komarek","year":"2004"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1198\/004017007000000245"},{"key":"ref46","first-page":"42","author":"beck","year":"2009","journal-title":"Gradient-based Algorithms with Applications to Signal-recovery Problems"},{"key":"ref20","first-page":"739","article-title":"Towards a lower sample complexity for robust one-bit compressed sensing","author":"zhu","year":"0","journal-title":"Proceedings of the 32nd Intl Conf on Machine Learning"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.96.12.6745"},{"key":"ref22","first-page":"177","article-title":"Precision matrix estimation in high-dimensional gaussian graphical models with faster rates","volume":"51","author":"wang","year":"0","journal-title":"Proc 19th Int Conf Artif Intell"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-46128-1_50"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/j.sigpro.2017.05.020"},{"key":"ref42","first-page":"2111","article-title":"Convergence analysis of proximal gradient with momentum for nonconvex optimization","author":"li","year":"0","journal-title":"Proc 34th Int Conf Mach Learn"},{"key":"ref24","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1111\/j.2517-6161.1996.tb02080.x","article-title":"Regression shrinkage and selection via the Lasso","volume":"58","author":"tibshirani","year":"1996","journal-title":"J Roy Statist Soc B Statist Methodol"},{"key":"ref41","first-page":"379","article-title":"Accelerated proximal gradient methods for nonconvex programming","author":"li","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2016.2567482"},{"key":"ref44","article-title":"UCI machine learning repository","author":"dheeru","year":"2017"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/s11634-008-0030-7"},{"key":"ref43","first-page":"1","article-title":"CVXPY: A Python-embedded modeling language for convex optimization","volume":"17","author":"diamond","year":"2016","journal-title":"J Mach Learn Res"},{"key":"ref25","first-page":"592","article-title":"Online feature selection using grafting","author":"perkins","year":"0","journal-title":"Proc Int Conf Mach Learn"}],"container-title":["IEEE Transactions on Signal Processing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/78\/8353188\/08332502.pdf?arnumber=8332502","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,5]],"date-time":"2024-07-05T20:17:22Z","timestamp":1720210642000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8332502\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6,15]]},"references-count":47,"journal-issue":{"issue":"12"},"URL":"https:\/\/doi.org\/10.1109\/tsp.2018.2824289","relation":{},"ISSN":["1053-587X","1941-0476"],"issn-type":[{"value":"1053-587X","type":"print"},{"value":"1941-0476","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,6,15]]}}}