{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T20:17:58Z","timestamp":1740169078919,"version":"3.37.3"},"reference-count":33,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/OAPA.html"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61672005","11501115","11331003"],"award-info":[{"award-number":["61672005","11501115","11331003"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2018]]},"DOI":"10.1109\/access.2018.2836925","type":"journal-article","created":{"date-parts":[[2018,5,15]],"date-time":"2018-05-15T20:51:28Z","timestamp":1526417488000},"page":"28404-28416","source":"Crossref","is-referenced-by-count":8,"title":["Lagrange Dual Method for Sparsity Constrained Optimization"],"prefix":"10.1109","volume":"6","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8698-0024","authenticated-orcid":false,"given":"Wenxing","family":"Zhu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhengshan","family":"Dong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2112-6214","authenticated-orcid":false,"given":"Yuanlong","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianli","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"crossref","first-page":"1","DOI":"10.18637\/jss.v033.i01","article-title":"Regularization paths for generalized linear models via coordinate descent","volume":"33","author":"friedman","year":"2010","journal-title":"J Statist Softw"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1137\/120869997"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1137\/090777761"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1137\/100808071"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/BF02678430"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2008.07.002"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2007.910281"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1137\/050626090"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2005.1416408"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2009.2016892"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2007.898300"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/s00041-008-9035-z"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2010.2042411"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.sigpro.2011.09.017"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1287\/moor.2015.0722"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.904835"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-013-0714-4"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2009.2037655"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2007.4286571"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/s40305-015-0101-3"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/LGRS.2012.2230394"},{"journal-title":"Worst-Case Hardness of Approximation for Sparse Optimization With L0 Norm","year":"2017","author":"chen","key":"ref8"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539792240406"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.871582"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/78.258082"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1002\/cpa.20124"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/CAMSAP.2011.6136024"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2012.2203818"},{"journal-title":"Gradient support projection algorithm for affine feasibility problem with sparsity and nonnegativity","year":"2014","author":"pan","key":"ref21"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2245716"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2012.2185231"},{"journal-title":"Optimization over sparse symmetric sets via a nonmonotone projected gradient method","year":"2015","author":"lu","key":"ref26"},{"key":"ref25","first-page":"807","article-title":"Greedy sparsity-constrained optimization","volume":"14","author":"bahmani","year":"2013","journal-title":"J Mach Learn Res"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8274985\/08359279.pdf?arnumber=8359279","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,26]],"date-time":"2022-01-26T06:05:22Z","timestamp":1643177122000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8359279\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"references-count":33,"URL":"https:\/\/doi.org\/10.1109\/access.2018.2836925","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2018]]}}}