{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,18]],"date-time":"2026-08-18T00:37:32Z","timestamp":1787013452804,"version":"build-2736575974"},"reference-count":34,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[2013,3,1]],"date-time":"2013-03-01T00:00:00Z","timestamp":1362096000000},"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,3]]},"DOI":"10.1109\/tsp.2012.2236322","type":"journal-article","created":{"date-parts":[[2012,12,31]],"date-time":"2012-12-31T14:10:07Z","timestamp":1356963007000},"page":"1210-1214","source":"Crossref","is-referenced-by-count":26,"title":["Constructing Test Instances for Basis Pursuit Denoising"],"prefix":"10.1109","volume":"61","author":[{"given":"D. A.","family":"Lorenz","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1002\/nav.3800030109"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1137\/0303013"},{"key":"ref31","first-page":"1211","article-title":"Projection methods for finding a common point of convex sets","volume":"7","author":"gurin","year":"1967","journal-title":"Akad Nauk SSSR urnal Vyislitel' noi Matematiki i Matematieskoi Fiziki"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9939-1959-0105008-8"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/s001860300327"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1088\/0266-5611\/27\/8\/085009"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1002\/cpa.20350"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.858979"},{"key":"ref13","article-title":"Solving basis pursuit: Subgradient algorithm, heuristic optimality check, and solver comparison","author":"lorenz","year":"2011","journal-title":"Optim Online"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2007.910281"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2009.2016892"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1137\/090756855"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1137\/060657704"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.864420"},{"key":"ref19","author":"becker","year":"2011"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/j.cpc.2008.07.010"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1088\/0266-5611\/25\/3\/035008"},{"key":"ref27","first-page":"801","article-title":"Efficient sparse coding algorithms","volume":"19","author":"lee","year":"2007","journal-title":"Proc Neural Inf Process Syst (NIPS)"},{"key":"ref3","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"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2008.927802"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1137\/S0036144593251710"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2043876"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1137\/070697835"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1137\/S1064827596304010"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1088\/0266-5611\/24\/5\/055020"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1137\/080714488"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/s12532-011-0029-5"},{"key":"ref22","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":"ref21","author":"becker","year":"2011","journal-title":"Practical Compressed Sensing Modern Data Acquisition and Signal Processing"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1137\/080716542"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1137\/070703983"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1137\/090777761"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1088\/0266-5611\/24\/3\/035007"}],"container-title":["IEEE Transactions on Signal Processing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/78\/6451284\/06399612.pdf?arnumber=6399612","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,4]],"date-time":"2024-05-04T00:20:05Z","timestamp":1714782005000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6399612\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,3]]},"references-count":34,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.1109\/tsp.2012.2236322","relation":{},"ISSN":["1053-587X","1941-0476"],"issn-type":[{"value":"1053-587X","type":"print"},{"value":"1941-0476","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,3]]}}}