{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,16]],"date-time":"2026-07-16T03:48:21Z","timestamp":1784173701784,"version":"3.55.0"},"reference-count":71,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"10","license":[{"start":{"date-parts":[[2018,10,1]],"date-time":"2018-10-01T00:00:00Z","timestamp":1538352000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/501100000266","name":"Engineering and Physical Sciences Research Council","doi-asserted-by":"publisher","award":["EP\/M019802\/1"],"award-info":[{"award-number":["EP\/M019802\/1"]}],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000781","name":"ERC C-SENSE","doi-asserted-by":"publisher","award":["ERC-ADG-2015-694888"],"award-info":[{"award-number":["ERC-ADG-2015-694888"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000288","name":"Royal Society","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000288","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2018,10]]},"DOI":"10.1109\/tit.2018.2841379","type":"journal-article","created":{"date-parts":[[2018,5,28]],"date-time":"2018-05-28T18:29:36Z","timestamp":1527532176000},"page":"6707-6721","source":"Crossref","is-referenced-by-count":18,"title":["Inexact Gradient Projection and Fast Data Driven Compressed Sensing"],"prefix":"10.1109","volume":"64","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5822-2990","authenticated-orcid":false,"given":"Mohammad","family":"Golbabaee","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2327-236X","authenticated-orcid":false,"given":"Mike E.","family":"Davies","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref71","first-page":"3377","article-title":"Gradient projection iterative sketch for large scale constrained least-squares","author":"tang","year":"2017","journal-title":"Proc Int Conf Mach Learn (ICML)"},{"key":"ref70","first-page":"1842","article-title":"Iterative Hessian sketch: Fast and accurate solution approximation for constrained least-squares","volume":"17","author":"pilanci","year":"2016","journal-title":"J Mach Learn Res"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2013.2278147"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1137\/130947246"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2457939"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2014.07.004"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2273491"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6875152"},{"key":"ref37","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1038\/nature11971","article-title":"Magnetic resonance fingerprinting","volume":"495","author":"ma","year":"2013","journal-title":"Nature"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/s10851-012-0405-4"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TASLP.2013.2297012"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/ACSSC.2013.6810450"},{"key":"ref60","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-0131-8","author":"heinonen","year":"2001","journal-title":"Lectures on Analysis on Metric Spaces"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1145\/1273340.1273347"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374452"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2012.01.002"},{"key":"ref28","author":"nguyen","year":"2014","journal-title":"Linear convergence of stochastic iterative greedy algorithms with sparse constraints"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2011.08.001"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton.2011.6120244"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1145\/1132516.1132597"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-012-0629-5"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/s10851-013-0434-7"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-011-0484-9"},{"key":"ref68","first-page":"37","article-title":"Fast global convergence rates of gradient methods for high-dimensional statistical recovery","author":"agarwal","year":"2010","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref69","first-page":"1970","article-title":"Local linear convergence of forward–backward under partial smoothness","author":"liang","year":"2014","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.862083"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.871582"},{"key":"ref20","first-page":"1458","article-title":"Convergence rates of inexact proximal-gradient methods for convex optimization","author":"schmidt","year":"2011","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-013-0677-5"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/1143844.1143857"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1137\/110844805"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1137\/060676386"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2013.17"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1137\/140994964"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2011.2159837"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2012.2201149"},{"key":"ref59","first-page":"731a","article-title":"Étude d’une dimension métrique liée à la possibilité de plongements dans \n$R^{n}$","volume":"15","author":"assouad","year":"1979","journal-title":"C R Acad Sci Paris Sér A–B 288"},{"key":"ref58","first-page":"798","article-title":"Navigating nets: Simple algorithms for proximity search","author":"krauthgamer","year":"2004","journal-title":"Proc 15th Annu ACM-SIAM Symp Discrete Algorithms (SODA)"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1145\/1377676.1377685"},{"key":"ref56","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1090\/conm\/026\/737400","article-title":"Extensions of Lipschitz mappings into a Hilbert space","volume":"26","author":"johnson","year":"1984","journal-title":"Contemp Math"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2011.2165289"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1021\/ac103259v"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1007\/s10444-013-9325-0"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2013.2281405"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/s10851-010-0251-1"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2010.2072512"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1007\/11830924_28"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-009-0306-5"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1137\/050645506"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2012.6288484"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1983.10477029"},{"key":"ref16","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1007\/978-1-4613-9940-7_3","article-title":"A method for finding projections onto the intersection of convex sets in Hilbert spaces","author":"boyle","year":"1986","journal-title":"Advances in Order Restricted Statistical Inference"},{"key":"ref17","first-page":"212","article-title":"Iterative hard thresholding with near optimal projection for signal recovery","author":"giryes","year":"2013","journal-title":"Proc 10th Int Conf Sampling Theory Appl (SampTA)"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2017.02.028"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2146550"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/2184319.2184343"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.sigpro.2005.05.030"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2040894"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-007-9011-z"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2014.2329397"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2009.2038076"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.1302293110"},{"key":"ref9","first-page":"177","author":"bottou","year":"2010","journal-title":"Large-scale Machine Learning with Stochastic Gradient Descent"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1093\/imaiai\/iav005"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1137\/090748160"},{"key":"ref48","author":"oymak","year":"2015","journal-title":"Sharp time–data tradeoffs for linear inverse problems"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-012-9135-7"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(90)90014-6"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1137\/090771806"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1016\/j.sigpro.2011.09.017"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2009.04.002"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/8464702\/08368130.pdf?arnumber=8368130","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,26]],"date-time":"2022-01-26T09:45:40Z","timestamp":1643190340000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8368130\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,10]]},"references-count":71,"journal-issue":{"issue":"10"},"URL":"https:\/\/doi.org\/10.1109\/tit.2018.2841379","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,10]]}}}