{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T09:06:42Z","timestamp":1648890402082},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2015,4,10]],"date-time":"2015-04-10T00:00:00Z","timestamp":1428624000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Math Imaging Vis"],"published-print":{"date-parts":[[2015,11]]},"DOI":"10.1007\/s10851-015-0575-y","type":"journal-article","created":{"date-parts":[[2015,4,9]],"date-time":"2015-04-09T12:50:08Z","timestamp":1428583808000},"page":"251-263","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Optimal Dual Certificates for Noise Robustness Bounds in Compressive Sensing"],"prefix":"10.1007","volume":"53","author":[{"given":"Marc","family":"Nicod\u00e8me","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Flavius","family":"Turcu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Charles","family":"Dossal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,4,10]]},"reference":[{"key":"575_CR1","doi-asserted-by":"crossref","unstructured":"van den Berg, E., Friedlander, M.P.: Probing the pareto frontier for basis pursuit solutions. SIAM J. Sci. Comput. 31(2), 890\u2013912 (2008). doi: 10.1137\/080714488 . http:\/\/link.aip.org\/link\/?SCE\/31\/890","DOI":"10.1137\/080714488"},{"issue":"5","key":"575_CR2","doi-asserted-by":"crossref","first-page":"1411","DOI":"10.1088\/0266-5611\/20\/5\/005","volume":"20","author":"M Burger","year":"2004","unstructured":"Burger, M., Osher, S.: Convergence rates of convex variational regularization. Inverse Probl. 20(5), 1411 (2004)","journal-title":"Inverse Probl."},{"issue":"2","key":"575_CR3","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1109\/TIT.2005.862083","volume":"52","author":"EJ Candes","year":"2006","unstructured":"Candes, E.J., Romberg, J., Tao, T.: Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information. IEEE Trans. Inf. Theory 52(2), 489\u2013509 (2006)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"12","key":"575_CR4","doi-asserted-by":"crossref","first-page":"4203","DOI":"10.1109\/TIT.2005.858979","volume":"51","author":"EJ Candes","year":"2005","unstructured":"Candes, E.J., Tao, T.: Decoding by linear programming. IEEE Trans. Inf. Theory 51(12), 4203\u20134215 (2005)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"5A","key":"575_CR5","doi-asserted-by":"crossref","first-page":"2145","DOI":"10.1214\/08-AOS653","volume":"37","author":"EJ Cand\u00e8s","year":"2007","unstructured":"Cand\u00e8s, E.J., Plan, Y.: Near-ideal model selection by l1 minimization. Ann. Stat. 37(5A), 2145\u20132177 (2007)","journal-title":"Ann. Stat."},{"issue":"9\u201310","key":"575_CR6","doi-asserted-by":"crossref","first-page":"589","DOI":"10.1016\/j.crma.2008.03.014","volume":"346","author":"EJ Candes","year":"2008","unstructured":"Candes, E.J.: The restricted isometry property and its implications for compressed sensing. Comptes Rendus Math. 346(9\u201310), 589\u2013592 (2008)","journal-title":"Comptes Rendus Math."},{"key":"575_CR7","unstructured":"Candes, E., Fernandez-Granda, C.: Super-resolution from noisy data. arXiv preprint arXiv:1211.0290 (2012)"},{"key":"575_CR8","doi-asserted-by":"crossref","unstructured":"Cand\u00e8s, E.J., Fernandez-Granda, C.: Towards a mathematical theory of super-resolution. Commun. Pure Appl. Math. 67(6), 906\u2013956 (2014)","DOI":"10.1002\/cpa.21455"},{"issue":"1","key":"575_CR9","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1137\/S1064827596304010","volume":"20","author":"SS Chen","year":"1998","unstructured":"Chen, S.S., Donoho, D.L., Saunders, M.A.: Atomic decomposition by basis pursuit. SIAM J. Sci. Comput. 20(1), 33\u201361 (1998). doi: 10.1137\/S1064827596304010","journal-title":"SIAM J. Sci. Comput."},{"key":"575_CR10","volume-title":"Foundations of Computer-Aided Process Operations","author":"J Currie","year":"2012","unstructured":"Currie, J., Wilson, D.I.: OPTI: lowering the barrier between open source optimizers and the industrial MATLAB user. In: Sahinidis, N., Pinto, J. (eds.) Foundations of Computer-Aided Process Operations. Savannah, Georgia (2012)"},{"key":"575_CR11","unstructured":"David, L.D.: Neighborly polytopes and sparse solutions of underdetermined linear equations, Technical Report (2005)"},{"issue":"4","key":"575_CR12","doi-asserted-by":"crossref","first-page":"1289","DOI":"10.1109\/TIT.2006.871582","volume":"52","author":"DL Donoho","year":"2006","unstructured":"Donoho, D.L.: Compressed sensing. IEEE Trans. Inf. Theory 52(4), 1289\u20131306 (2006)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"575_CR13","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/j.crma.2011.12.014","volume":"350","author":"C Dossal","year":"2012","unstructured":"Dossal, C.: A necessary and sufficient condition for exact sparse recovery by l1 minimization. Comptes Rendus Math. 350(1), 117\u2013120 (2012)","journal-title":"Comptes Rendus Math."},{"key":"575_CR14","doi-asserted-by":"crossref","unstructured":"Dossal, C., Tesson, R.: Consistency of l1 recovery from noisy deterministic measurements. Appl. Comput. Harmonic Anal. 36(3), 508\u2013513 (2014)","DOI":"10.1016\/j.acha.2013.08.001"},{"key":"575_CR15","doi-asserted-by":"crossref","unstructured":"Duval, V., Peyr\u00e9, G.: Exact support recovery for sparse spikes deconvolution. arXiv preprint arXiv:1306.6909 (2013)","DOI":"10.1007\/s10208-014-9228-6"},{"issue":"6","key":"575_CR16","doi-asserted-by":"crossref","first-page":"1341","DOI":"10.1109\/TIT.2004.828141","volume":"50","author":"JJ Fuchs","year":"2004","unstructured":"Fuchs, J.J.: On sparse representations in arbitrary redundant bases. IEEE Trans. Inf. Theory 50(6), 1341\u20131344 (2004). doi: 10.1109\/TIT.2004.828141","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"575_CR17","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1109\/56.2083","volume":"4","author":"EG Gilbert","year":"1988","unstructured":"Gilbert, E.G., Johnson, D.W., Keerthi, S.S.: A fast procedure for computing the distance between complex objects in three-dimensional space. IEEE J. Robot. Autom. 4(2), 193\u2013203 (1988)","journal-title":"IEEE J. Robot. Autom."},{"key":"575_CR18","first-page":"57","volume":"46","author":"O Golubitsky","year":"2012","unstructured":"Golubitsky, O., Mazalov, V., Watt, S.M.: An algorithm to compute the distance from a point to a simplex. ACM Commun. Comput. Algebra 46, 57\u201357 (2012)","journal-title":"ACM Commun. Comput. Algebra"},{"issue":"2","key":"575_CR19","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1002\/cpa.20350","volume":"64","author":"M Grasmair","year":"2011","unstructured":"Grasmair, M., Scherzer, O., Haltmeier, M.: Necessary and sufficient conditions for linear convergence of l1-regularization. Commun. Pure Appl. Math. 64(2), 161\u2013182 (2011). doi: 10.1002\/cpa.20350","journal-title":"Commun. Pure Appl. Math."},{"issue":"9","key":"575_CR20","doi-asserted-by":"crossref","first-page":"3188","DOI":"10.1109\/TIT.2007.903129","volume":"53","author":"MD Plumbley","year":"2007","unstructured":"Plumbley, M.D.: On polar polytopes and the recovery of sparse representations. IEEE Trans. Inf. Theory 53(9), 3188\u20133195 (2007)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"575_CR21","volume-title":"Variational Methods in Imaging","author":"O Scherzer","year":"2009","unstructured":"Scherzer, O., Grasmair, M., Grossauer, H., Haltmeier, M., Lenzen, F.: Variational Methods in Imaging. Springer, Berlin (2009)"},{"issue":"3","key":"575_CR22","doi-asserted-by":"crossref","first-page":"1030","DOI":"10.1109\/TIT.2005.864420","volume":"52","author":"JA Tropp","year":"2006","unstructured":"Tropp, J.A.: Just relax: convex programming methods for identifying sparse signals in noise. IEEE Trans. Inf. Theory 52(3), 1030\u20131051 (2006)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"575_CR23","doi-asserted-by":"crossref","unstructured":"Vaiter, S., Peyr\u00e9, G., Dossal, C., Fadili, J.: Robust sparse analysis regularization. IEEE Trans. Inf. Theory 59(4), 2001\u20132016 (2013)","DOI":"10.1109\/TIT.2012.2233859"}],"container-title":["Journal of Mathematical Imaging and Vision"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10851-015-0575-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10851-015-0575-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10851-015-0575-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,23]],"date-time":"2019-08-23T05:34:00Z","timestamp":1566538440000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10851-015-0575-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,4,10]]},"references-count":23,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2015,11]]}},"alternative-id":["575"],"URL":"https:\/\/doi.org\/10.1007\/s10851-015-0575-y","relation":{},"ISSN":["0924-9907","1573-7683"],"issn-type":[{"value":"0924-9907","type":"print"},{"value":"1573-7683","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,4,10]]}}}