{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,5]],"date-time":"2026-03-05T11:39:13Z","timestamp":1772710753298,"version":"3.50.1"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2017,4,10]],"date-time":"2017-04-10T00:00:00Z","timestamp":1491782400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Adv Comput Math"],"published-print":{"date-parts":[[2018,2]]},"DOI":"10.1007\/s10444-017-9533-0","type":"journal-article","created":{"date-parts":[[2017,4,10]],"date-time":"2017-04-10T06:27:53Z","timestamp":1491805673000},"page":"1-21","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["Sparse blind deconvolution and demixing through \u2113 1,2-minimization"],"prefix":"10.1007","volume":"44","author":[{"given":"Axel","family":"Flinth","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,4,10]]},"reference":[{"issue":"3","key":"9533_CR1","doi-asserted-by":"crossref","first-page":"1711","DOI":"10.1109\/TIT.2013.2294644","volume":"60","author":"A Ahmed","year":"2014","unstructured":"Ahmed, A., Recht, B., Romberg, J.: Blind deconvolution using convex programming. IEEE Trans. Inf. Theory 60(3), 1711\u20131732 (2014)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9533_CR2","doi-asserted-by":"crossref","unstructured":"Asi, M. S., Mantzel, W., Romberg, J.: Channel protection: Random coding meets sparse channels IEEE Information Theory Workshop, vol. 2009, pp 348\u2013352, Taormina (2009)","DOI":"10.1109\/ITW.2009.5351495"},{"key":"9533_CR3","doi-asserted-by":"crossref","first-page":"4203","DOI":"10.1109\/TIT.2005.858979","volume":"51","author":"E Cand\u00e8s","year":"2005","unstructured":"Cand\u00e8s, E., Tao, T.: Decoding by linear programming. IEEE Trans. Inf. Theory 51, 4203\u20134215 (2005)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"11","key":"9533_CR4","doi-asserted-by":"crossref","first-page":"5302","DOI":"10.1109\/TIT.2009.2030471","volume":"55","author":"Y Eldar","year":"2009","unstructured":"Eldar, Y., Mishali, M.: Robust recovery of signals from a structured union of subspaces. IEEE Trans. Inf Theory 55(11), 5302\u20135316 (2009)","journal-title":"IEEE Trans. Inf Theory"},{"key":"9533_CR5","doi-asserted-by":"crossref","unstructured":"Foucart, S., Rauhut, H.: A Mathematical Introduction to Compressed Sensing. Birkh\u00e4user (2013)","DOI":"10.1007\/978-0-8176-4948-7"},{"issue":"3","key":"9533_CR6","doi-asserted-by":"crossref","first-page":"1548","DOI":"10.1109\/TIT.2011.2104999","volume":"57","author":"D Gross","year":"2011","unstructured":"Gross, D.: Recovering low-rank matrices from few coefficients in any basis. IEEE Trans. Inf. Theory 57(3), 1548\u20131566 (2011)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9533_CR7","unstructured":"Kech, M., Krahmer, F.: Optimal injectivity conditions for bilinear inverse problems with applications to identifiability of deconvolution problems (2016). arXiv: 1603.07316"},{"key":"9533_CR8","doi-asserted-by":"crossref","unstructured":"Koltchinskii, V.: A remark on low rank matrix recovery and noncommutative Bernstein type inequalities From robability to statistics and back: High-dimensional models and processes \u2013 a festschrift in honor of Jon A. Wellner, pp 213\u2013226. Institute of Mathematical Statistics (2013)","DOI":"10.1214\/12-IMSCOLL915"},{"key":"9533_CR9","unstructured":"Lee, K., Wu, Y., Bresler, Y.: Near optimal compressed sensing of sparse rank-one matrices via sparse power factorization (2013). arXiv: 1312.0525"},{"key":"9533_CR10","unstructured":"Ling, S., Strohmer, T.: Blind deconvolution meets blind demixing: Algorithms and performance bounds. arXiv: 1512.07730 (2015)"},{"key":"9533_CR11","doi-asserted-by":"crossref","unstructured":"Ling, S., Strohmer, T.: Self-calibration and biconvex compressive sensing. Inverse Probl. 31, 115002 (2015)","DOI":"10.1088\/0266-5611\/31\/11\/115002"},{"issue":"3","key":"9533_CR12","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1137\/070697835","volume":"52","author":"B Recht","year":"2010","unstructured":"Recht, B., Fazel, M., Parrilo, P. A.: Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization. SIAM Rev. 52(3), 471\u2013501 (2010)","journal-title":"SIAM Rev."},{"key":"9533_CR13","doi-asserted-by":"crossref","unstructured":"Stoeger, D., Jung, P., Krahmer, F.: Blind deconvolution and compressed sensing. In Cosera, 2016 (2016)","DOI":"10.1109\/CoSeRa.2016.7745692"},{"issue":"8","key":"9533_CR14","doi-asserted-by":"crossref","first-page":"3075","DOI":"10.1109\/TSP.2009.2020754","volume":"57","author":"M Stojnic","year":"2009","unstructured":"Stojnic, M., Parvaresh, F., Hassibi, B.: On the reconstruction of block-sparse signals with an optimal number of measurements. IEEE Trans. Signal Process. 57 (8), 3075\u20133085 (2009)","journal-title":"IEEE Trans. Signal Process."},{"issue":"4","key":"9533_CR15","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1007\/s10208-011-9099-z","volume":"12","author":"JA Tropp","year":"2012","unstructured":"Tropp, J. A.: User-friendly tail bounds for sums of random matrices. Found. Comp. Math. 12(4), 389\u2013434 (2012)","journal-title":"Found. Comp. Math."},{"key":"9533_CR16","doi-asserted-by":"crossref","unstructured":"Vershinyn, R.: Introduction to the non-asymptotic analysis of random matrices. In: Compressed Sensing, Theory and Applications, chapter 5. Cambridge University Press (2012)","DOI":"10.1017\/CBO9780511794308.006"}],"container-title":["Advances in Computational Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10444-017-9533-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10444-017-9533-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10444-017-9533-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,20]],"date-time":"2019-09-20T17:21:11Z","timestamp":1569000071000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10444-017-9533-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,4,10]]},"references-count":16,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,2]]}},"alternative-id":["9533"],"URL":"https:\/\/doi.org\/10.1007\/s10444-017-9533-0","relation":{},"ISSN":["1019-7168","1572-9044"],"issn-type":[{"value":"1019-7168","type":"print"},{"value":"1572-9044","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,4,10]]}}}