{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,19]],"date-time":"2026-05-19T15:26:17Z","timestamp":1779204377077,"version":"3.51.4"},"reference-count":41,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"22","license":[{"start":{"date-parts":[[2013,11,1]],"date-time":"2013-11-01T00:00:00Z","timestamp":1383264000000},"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":[[2013,11]]},"DOI":"10.1109\/tsp.2013.2281030","type":"journal-article","created":{"date-parts":[[2013,9,6]],"date-time":"2013-09-06T18:05:00Z","timestamp":1378490700000},"page":"5777-5788","source":"Crossref","is-referenced-by-count":50,"title":["RSP-Based Analysis for Sparsest and Least $\\ell_1$-Norm Solutions to Underdetermined Linear Systems"],"prefix":"10.1109","volume":"61","author":[{"given":"Yun-Bin","family":"Zhao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1137\/070703983"},{"key":"ref38","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\">$\\ell_1$<\/tex> <\/formula>-norm solution and the sparsest solution","volume":"86","author":"tsaig","year":"2006","journal-title":"Signal Process"},{"key":"ref33","author":"sharon","year":"2007","journal-title":"?Computation and relaxation of conditions for equivalence between and minimization ?"},{"key":"ref32","author":"schrijver","year":"1986","journal-title":"Theory of Linear and Integer Programming"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/s00440-012-0441-4"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539792240406"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2010.2044010"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.909108"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.834793"},{"key":"ref34","author":"tang","year":"2011","journal-title":"?Verifiable and computational performance analysis of sparsity recovery ?"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/s00041-008-9045-x"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1007\/s40305-013-0010-2"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1137\/S1064827596304010"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1090\/S0894-0347-08-00610-3"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511794308.002"},{"key":"ref14","author":"donoho","year":"2005","journal-title":"?Neighborly polytopes and sparse solutions of underdetermined linear equations ?"},{"key":"ref15","doi-asserted-by":"crossref","first-page":"797","DOI":"10.1002\/cpa.20132","article-title":"For most large underdetermined systems of linear equations, the minimal <formula formulatype=\"inline\"><tex Notation=\"TeX\">$\\ell_1$<\/tex><\/formula>-norm solution is also the sparsest solution","volume":"59","author":"donoho","year":"2006","journal-title":"Commun Pure Appl Math"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.871582"},{"key":"ref17","doi-asserted-by":"crossref","first-page":"2197","DOI":"10.1073\/pnas.0437847100","article-title":"Optimality sparse representation in general (non-orthogonal) dictionaries via <formula formulatype=\"inline\"><tex Notation=\"TeX\">$\\ell_1$<\/tex> <\/formula> minimization","volume":"100","author":"donoho","year":"2003","journal-title":"Proc Nat Acad Sci"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0502269102"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.crma.2011.12.014"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2004.1326377"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1137\/060657704"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-010-0417-z"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.11.3.217"},{"key":"ref6","first-page":"5914","article-title":"Practical signal recovery from random projections","author":"cand\ufffds","year":"2005","journal-title":"Proc SPIE Conf Wavelets X"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1080\/02331939908844431"},{"key":"ref5","first-page":"1433","article-title":"Compressive sampling","volume":"iii","author":"cand\ufffds","year":"2006","journal-title":"Proc Int Congr Math"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1002\/cpa.20124"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.862083"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1023\/A:1018361916442"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1137\/0715015"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.858979"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-7011-4"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2003.811926"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.801410"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.828141"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1137\/110847445"},{"key":"ref23","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1016\/j.acha.2008.09.001","article-title":"Sparsest solutions of underdetermined linear systems via <formula formulatype=\"inline\"><tex Notation=\"TeX\">$\\ell_p$<\/tex> <\/formula>-minimization for <formula formulatype=\"inline\"><tex Notation=\"TeX\">$0 &#60; q\\leq 1$<\/tex><\/formula>","volume":"26","author":"foucart","year":"2009","journal-title":"Appl Comput Harmon Anal"},{"key":"ref26","doi-asserted-by":"crossref","first-page":"1107","DOI":"10.1137\/070698920","article-title":"Fixed-point continuation for <formula formulatype=\"inline\"> <tex Notation=\"TeX\">$\\ell_1$<\/tex><\/formula>-minimization: Methodology and convergence","volume":"19","author":"hale","year":"2008","journal-title":"SIAM J Optim"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2003.820031"}],"container-title":["IEEE Transactions on Signal Processing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/78\/6626366\/06589953.pdf?arnumber=6589953","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:48:27Z","timestamp":1642006107000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6589953\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,11]]},"references-count":41,"journal-issue":{"issue":"22"},"URL":"https:\/\/doi.org\/10.1109\/tsp.2013.2281030","relation":{},"ISSN":["1053-587X","1941-0476"],"issn-type":[{"value":"1053-587X","type":"print"},{"value":"1941-0476","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,11]]}}}