{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T21:52:55Z","timestamp":1774993975921,"version":"3.50.1"},"reference-count":49,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2011,4,1]],"date-time":"2011-04-01T00:00:00Z","timestamp":1301616000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Signal Process."],"published-print":{"date-parts":[[2011,4]]},"DOI":"10.1109\/tsp.2010.2103066","type":"journal-article","created":{"date-parts":[[2011,1,3]],"date-time":"2011-01-03T19:35:51Z","timestamp":1294083351000},"page":"1895-1901","source":"Crossref","is-referenced-by-count":35,"title":["An Alternative Lagrange-Dual Based Algorithm for Sparse Signal Reconstruction"],"prefix":"10.1109","volume":"59","author":[{"given":"Yiju","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guanglu","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Louis","family":"Caccetta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wanquan","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1007\/b98874"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1007\/s11263-007-0122-4"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/78.258082"},{"key":"ref32","article-title":"Rapid MR angiography with randomly under-sampled 3DFT trajectories and nonlinear reconstruction","author":"lustig","year":"2006","journal-title":"9th Annu Meeting Soc For Cardiovascular Magnetic Resonance"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TNS.2004.829789"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2007.910971"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2008.07.002"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539792240406"},{"key":"ref35","doi-asserted-by":"crossref","DOI":"10.1201\/9781420035933","author":"miller","year":"2002","journal-title":"Subset Selection in Regression"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1137\/0317052"},{"key":"ref28","author":"hale","year":"2007","journal-title":"A fixed-point continuation method for l1 -regularized minimization with applications to compressed sensing"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/509907.509933"},{"key":"ref29","first-page":"20","article-title":"A deterministic sub-linear time sparse Fourier algorithm via non-adaptive compressed sensing methods","author":"iwen","year":"2008","journal-title":"Proc ACM-SIAM Symp Discrete Algorithms (SODA)"},{"key":"ref2","author":"bazaraa","year":"1993","journal-title":"Nonlinear Programming Theory and Algorithms"},{"key":"ref1","first-page":"97","article-title":"Learning a sparse representation for object detection","author":"agarwal","year":"2002","journal-title":"ECCV"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1002\/cpa.20132"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.801410"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/18.959265"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2007.910281"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ICIP.2005.1530172"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.828141"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2004.1326312"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.858979"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2007.914731"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2009.2030111"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2008.4517745"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1137\/S1064827596304010"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/S0165-1684(01)00064-0"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2002.1009004"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1137\/S0895479898332928"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1002\/cpa.20042"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/BF02678430"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.871582"},{"key":"ref4","author":"bertsekas","year":"1995","journal-title":"Nonlinear Programming"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2003.815261"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1137\/0916069"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.crma.2008.03.014"},{"key":"ref7","first-page":"1433","article-title":"Compressive sampling","volume":"3","author":"cande`s","year":"2006","journal-title":"Proc Int Congr Math"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1162\/089976601300014385"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.862083"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2008.79"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1016\/j.sigpro.2005.05.029"},{"key":"ref48","article-title":"A coordinate gradient descent method for l1-regularized convex minimization","author":"yun","year":"0","journal-title":"Comput Optim Appl"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972795.68"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2010.2044010"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.864420"},{"key":"ref44","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1016\/j.sigpro.2005.05.028","article-title":"Breakdown of equivalence between the minimal <formula formulatype=\"inline\"><tex Notation=\"TeX\">$l_1$<\/tex> <\/formula>-norm solution and the sparsest solution","volume":"86","author":"tsaig","year":"2006","journal-title":"Signal Process"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.909108"}],"container-title":["IEEE Transactions on Signal Processing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/78\/5725269\/05677612.pdf?arnumber=5677612","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,10]],"date-time":"2021-10-10T23:46:59Z","timestamp":1633909619000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5677612\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,4]]},"references-count":49,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/tsp.2010.2103066","relation":{},"ISSN":["1053-587X","1941-0476"],"issn-type":[{"value":"1053-587X","type":"print"},{"value":"1941-0476","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,4]]}}}