{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T13:22:06Z","timestamp":1730208126682,"version":"3.28.0"},"reference-count":20,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,3]]},"DOI":"10.1109\/ciss.2011.5766115","type":"proceedings-article","created":{"date-parts":[[2011,5,13]],"date-time":"2011-05-13T14:17:38Z","timestamp":1305296258000},"page":"1-6","source":"Crossref","is-referenced-by-count":2,"title":["Verifiable and computable ℓ<inf>∞<\/inf> performance evaluation of ℓ<inf>1<\/inf> sparse signal recovery"],"prefix":"10.1109","author":[{"given":"Gongguo","family":"Tang","sequence":"first","affiliation":[]},{"given":"Arye","family":"Nehorai","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","article-title":"A simple proof for recoverability of $\\ell_{1}$ minimization: go over or under?","author":"zhang","year":"2005","journal-title":"Tech Rep"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/18.959265"},{"key":"ref12","article-title":"High-dimensional centrally-symmetric polytopes with neighborliness proportional to dimension","author":"donoho","year":"2004","journal-title":"Technical Report"},{"key":"ref13","article-title":"On verifiable sufficient conditions for sparse signal recovery via $\\ell_{1}$ minimization","author":"juditsky","year":"2010","journal-title":"ArXiv e-prints"},{"key":"ref14","article-title":"Testing the nullspace property using semidefinite programming","author":"d'aspremont","year":"2010","journal-title":"ArXiv e-prints"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/BF02123011"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2011.2164913"},{"article-title":"Verifiable and computable $l$ ? performance evaluation of $\\ell_{1}$ sparse signal recovery","year":"2011","author":"tang","key":"ref17"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/s00039-007-0618-7"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2005.850882"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ACSSC.2010.5757635"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1002\/mrm.21391"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/SSP.2007.4301250"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1214\/009053606000001523"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1137\/S1064827596304010"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.crma.2008.03.014"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2039039"},{"key":"ref9","first-page":"267","article-title":"Regression shrinkage and selection via lasso","volume":"58","author":"tibshirani","year":"0","journal-title":"J Roy Statist Soc Ser B"},{"article-title":"$\\ell_{1}$-magic: Recovery of sparse signals via convex programming","year":"2005","author":"candes","key":"ref20"}],"event":{"name":"2011 45th Annual Conference on Information Sciences and Systems (CISS)","start":{"date-parts":[[2011,3,23]]},"location":"Baltimore, MD, USA","end":{"date-parts":[[2011,3,25]]}},"container-title":["2011 45th Annual Conference on Information Sciences and Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5764460\/5766094\/05766115.pdf?arnumber=5766115","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,21]],"date-time":"2017-03-21T03:37:32Z","timestamp":1490067452000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5766115\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,3]]},"references-count":20,"URL":"https:\/\/doi.org\/10.1109\/ciss.2011.5766115","relation":{},"subject":[],"published":{"date-parts":[[2011,3]]}}}