{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T23:42:31Z","timestamp":1768002151864,"version":"3.49.0"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T00:00:00Z","timestamp":1556582400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["KR 4512\/2-1"],"award-info":[{"award-number":["KR 4512\/2-1"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["28586557"],"award-info":[{"award-number":["28586557"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Adv Comput Math"],"published-print":{"date-parts":[[2019,6]]},"DOI":"10.1007\/s10444-019-09698-6","type":"journal-article","created":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T13:12:19Z","timestamp":1556629939000},"page":"1711-1728","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Sparse power factorization: balancing peakiness and sample complexity"],"prefix":"10.1007","volume":"45","author":[{"given":"Jakob","family":"Geppert","sequence":"first","affiliation":[]},{"given":"Felix","family":"Krahmer","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0543-9456","authenticated-orcid":false,"given":"Dominik","family":"St\u00f6ger","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,4,30]]},"reference":[{"issue":"3","key":"9698_CR1","doi-asserted-by":"publisher","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. Inform. Theory 60(3), 1711\u20131732 (2014)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"5B","key":"9698_CR2","doi-asserted-by":"publisher","first-page":"2877","DOI":"10.1214\/08-AOS664","volume":"37","author":"AA Amini","year":"2009","unstructured":"Amini, A.A., Wainwright, M.J.: High-dimensional analysis of semidefinite relaxations for sparse principal components. Ann. Stat. 37(5B), 2877\u20132921 (2009)","journal-title":"Ann. Stat."},{"issue":"3","key":"9698_CR3","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1093\/imaiai\/iaw012","volume":"5","author":"S Bahmani","year":"2016","unstructured":"Bahmani, S., Romberg, J.: Near-optimal estimation of simultaneously sparse and low-rank matrices from nested linear measurements. Inf. Inference 5(3), 331\u2013351 (2016)","journal-title":"Inf. Inference"},{"key":"9698_CR4","unstructured":"Bahmani, S., Romberg, J.: Solving equations of random convex functions via anchored regression. arXiv:\n                    1702.05327\n                    \n                   (2017)"},{"issue":"4","key":"9698_CR5","doi-asserted-by":"publisher","first-page":"1780","DOI":"10.1214\/13-AOS1127","volume":"41","author":"Q Berthet","year":"2013","unstructured":"Berthet, Q., Rigollet, P.: Optimal detection of sparse principal components in high dimension. Ann. Stat. 41(4), 1780\u20131815 (2013)","journal-title":"Ann. Stat."},{"issue":"4","key":"9698_CR6","doi-asserted-by":"publisher","first-page":"1985","DOI":"10.1109\/TIT.2015.2399924","volume":"61","author":"EJ Candes","year":"2015","unstructured":"Candes, E.J., Li, X., Soltanolkotabi, M.: Phase retrieval via Wirtinger flow: theory and algorithms. IEEE Trans. Inform. Theory 61(4), 1985\u20132007 (2015)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"2","key":"9698_CR7","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1109\/TIT.2005.862083","volume":"52","author":"EJ Cand\u00e8s","year":"2006","unstructured":"Cand\u00e8s, E.J., Romberg, J., Tao, T.: Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information. IEEE Trans. Inform. Theory 52(2), 489\u2013509 (2006)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"9698_CR8","first-page":"1269","volume":"9","author":"A d\u2019Aspremont","year":"2008","unstructured":"d\u2019Aspremont, A., Bach, F., Ghaoui, L.E.: Optimal solutions for sparse principal component analysis. J. Mach. Learn. Res. 9, 1269\u20131294 (2008)","journal-title":"J. Mach. Learn. Res."},{"key":"9698_CR9","unstructured":"Deshpande, Y., Montanari, A.: Sparse PCA via covariance thresholding. In: Advances in Neural Information Processing Systems, pp. 334\u2013342 (2014)"},{"key":"9698_CR10","unstructured":"Fornasier, M., Maly, J., Naumova, V.: At-las _ {2, 1}: A multi-penalty approach to compressed sensing of low-rank matrices with sparse decompositions. arXiv:\n                    1801.06240\n                    \n                   (2018)"},{"issue":"6","key":"9698_CR11","doi-asserted-by":"publisher","first-page":"2543","DOI":"10.1137\/100806278","volume":"49","author":"S Foucart","year":"2011","unstructured":"Foucart, S.: Hard thresholding pursuit: an algorithm for compressive sensing. SIAM J. Numer. Anal. 49(6), 2543\u20132563 (2011)","journal-title":"SIAM J. Numer. Anal."},{"key":"9698_CR12","doi-asserted-by":"crossref","unstructured":"Geppert, J.A., Krahmer, F., St\u00f6ger, D.: Refined performance guarantees for sparse power factorization. In: 2017 International Conference on Sampling Theory and Applications (SampTA), pp. 509\u2013513. IEEE (2017)","DOI":"10.1109\/SAMPTA.2017.8024391"},{"key":"9698_CR13","volume-title":"Blind Deconvolution","author":"S Haykin","year":"1994","unstructured":"Haykin, S.: Blind Deconvolution. Prentice Hall, New Jersey (1994)"},{"issue":"1","key":"9698_CR14","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/j.acha.2015.06.007","volume":"42","author":"M Iwen","year":"2017","unstructured":"Iwen, M., Viswanathan, A., Wang, Y.: Robust sparse phase retrieval made easy. Appl. Comput. Harmon. Anal. 42(1), 135\u2013142 (2017)","journal-title":"Appl. Comput. Harmon. Anal."},{"key":"9698_CR15","doi-asserted-by":"crossref","unstructured":"Jain, P., Netrapalli, P., Sanghavi, S.: Low-rank matrix completion using alternating minimization. In: Proceedings of the Forty-fifth Annual ACM Symposium on Theory of Computing, STOC \u201913, pp. 665\u2013674. ACM, New York (2013)","DOI":"10.1145\/2488608.2488693"},{"key":"9698_CR16","first-page":"517","volume":"11","author":"M Journ\u00e9e","year":"2010","unstructured":"Journ\u00e9e, M., Nesterov, Y., Richt\u00e1rik, P., Sepulchre, R.: Generalized power method for sparse principal component analysis. J. Mach. Learn. Res. 11, 517\u2013553 (2010)","journal-title":"J. Mach. Learn. Res."},{"issue":"2","key":"9698_CR17","doi-asserted-by":"publisher","first-page":"704","DOI":"10.1109\/TIT.2017.2784481","volume":"64","author":"P Jung","year":"2018","unstructured":"Jung, P., Krahmer, F., St\u00f6ger, D.: Blind demixing and deconvolution at near-optimal rate. IEEE Trans. Inform. Theory 64(2), 704\u2013727 (2018)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"1","key":"9698_CR18","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1137\/16M1067469","volume":"1","author":"M Kech","year":"2017","unstructured":"Kech, M., Krahmer, F.: Optimal injectivity conditions for bilinear inverse problems with applications to identifiability of deconvolution problems. SIAM J. Appl. Alg. Geom. 1(1), 20\u201337 (2017). \n                    https:\/\/doi.org\/10.1137\/16M1067469","journal-title":"SIAM J. Appl. Alg. Geom."},{"issue":"3","key":"9698_CR19","doi-asserted-by":"publisher","first-page":"1300","DOI":"10.1214\/15-AOS1310","volume":"43","author":"R Krauthgamer","year":"2015","unstructured":"Krauthgamer, R., Nadler, B., Vilenchik, D.: Do semidefinite relaxations solve sparse PCA up to the information limit. Ann. Statist. 43(3), 1300\u20131322 (2015)","journal-title":"Ann. Statist."},{"key":"9698_CR20","unstructured":"Lee, K., Junge, M.: Rip-like properties in subsampled blind deconvolution. arXiv:\n                    1511.06146\n                    \n                   (2015)"},{"key":"9698_CR21","unstructured":"Lee, K., Krahmer, F., Romberg, J.: Spectral methods for passive imaging: non-asymptotic performance and robustness. arXiv:\n                    1708.04343\n                    \n                   (2017)"},{"issue":"2","key":"9698_CR22","doi-asserted-by":"publisher","first-page":"802","DOI":"10.1109\/TIT.2016.2636204","volume":"63","author":"K Lee","year":"2017","unstructured":"Lee, K., Li, Y., Junge, M., Bresler, Y.: Blind recovery of sparse signals from subsampled convolution. IEEE Trans. Inform. Theory 63(2), 802\u2013821 (2017)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"9698_CR23","doi-asserted-by":"crossref","unstructured":"Lee, K., Wu, Y., Bresler, Y.: Near optimal compressed sensing of a class of sparse low-rank matrices via sparse power factorization. IEEE Trans. Inform Theory (2017)","DOI":"10.1109\/TIT.2017.2784479"},{"key":"9698_CR24","unstructured":"Li, X., Ling, S., Strohmer, T., Wei, K.: Rapid, robust, and reliable blind deconvolution via nonconvex optimization. arXiv:\n                    1606.04933\n                    \n                   (2016)"},{"issue":"11","key":"9698_CR25","doi-asserted-by":"publisher","first-page":"115,002","DOI":"10.1088\/0266-5611\/31\/11\/115002","volume":"31","author":"S Ling","year":"2015","unstructured":"Ling, S., Strohmer, T.: Self-calibration and biconvex compressive sensing. Inverse Probl 31(11), 115,002 (2015)","journal-title":"Inverse Probl"},{"issue":"7","key":"9698_CR26","doi-asserted-by":"publisher","first-page":"4497","DOI":"10.1109\/TIT.2017.2701342","volume":"63","author":"S Ling","year":"2017","unstructured":"Ling, S., Strohmer, T.: Blind deconvolution meets blind demixing: algorithms and performance bounds. IEEE Trans. Inform. Theory 63(7), 4497\u20134520 (2017)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"9698_CR27","unstructured":"Ling, S., Strohmer, T.: Regularized gradient descent: a nonconvex recipe for fast joint blind deconvolution and demixing. arXiv:\n                    1703.08642\n                    \n                   (2017)"},{"issue":"2","key":"9698_CR28","doi-asserted-by":"publisher","first-page":"772","DOI":"10.1214\/13-AOS1097","volume":"41","author":"Z Ma","year":"2013","unstructured":"Ma, Z.: Sparse principal component analysis and iterative thresholding. Ann. Statist. 41(2), 772\u2013801 (2013)","journal-title":"Ann. Statist."},{"issue":"6","key":"9698_CR29","doi-asserted-by":"publisher","first-page":"3491","DOI":"10.1214\/18-AAP1391","volume":"28","author":"S Mendelson","year":"2018","unstructured":"Mendelson, S., Rauhut, H., Ward, R., et al.: Improved bounds for sparse recovery from subsampled random convolutions. Ann. Appl. Probab. 28(6), 3491\u20133527 (2018)","journal-title":"Ann. Appl. Probab."},{"issue":"3","key":"9698_CR30","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1016\/j.acha.2008.07.002","volume":"26","author":"D Needell","year":"2009","unstructured":"Needell, D., Tropp, J.A.: Cosamp: iterative signal recovery from incomplete and inaccurate samples. Appl. Comput. Harmon. Anal. 26(3), 301\u2013321 (2009)","journal-title":"Appl. Comput. Harmon. Anal."},{"issue":"5","key":"9698_CR31","doi-asserted-by":"publisher","first-page":"2886","DOI":"10.1109\/TIT.2015.2401574","volume":"61","author":"S Oymak","year":"2015","unstructured":"Oymak, S., Jalali, A., Fazel, M., Eldar, Y.C., Hassibi, B.: Simultaneously structured models with application to sparse and low-rank matrices. IEEE Trans. Inform. Theory 61(5), 2886\u20132908 (2015)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"9698_CR32","unstructured":"Qu, Q., Zhang, Y., Eldar, Y.C., Wright, J.: Convolutional phase retrieval via gradient descent. arXiv:\n                    1712.00716\n                    \n                   (2017)"},{"key":"9698_CR33","unstructured":"Soltanolkotabi, M.: Structured signal recovery from quadratic measurements: breaking sample complexity barriers via nonconvex optimization. arXiv:\n                    1702.06175\n                    \n                   (2017)"},{"key":"9698_CR34","doi-asserted-by":"crossref","unstructured":"St\u00f6ger, D., Geppert, J.A., Krahmer, F.: Sparse power factorization with refined peakiness conditions. In: IEEE Statistical Signal Processing Workshop 2018. IEEE (2018)","DOI":"10.1109\/SSP.2018.8450850"},{"issue":"2","key":"9698_CR35","doi-asserted-by":"publisher","first-page":"1248","DOI":"10.1109\/TIT.2013.2290112","volume":"60","author":"AM Tillmann","year":"2014","unstructured":"Tillmann, A.M., Pfetsch, M.E.: The computational complexity of the restricted isometry property, the nullspace property, and related concepts in compressed sensing. IEEE Trans. Inform. Theory 60(2), 1248\u20131259 (2014)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"5","key":"9698_CR36","doi-asserted-by":"publisher","first-page":"1896","DOI":"10.1214\/15-AOS1369","volume":"44","author":"T Wang","year":"2016","unstructured":"Wang, T., Berthet, Q., Samworth, R.J.: Statistical and computational trade-offs in estimation of sparse principal components. Ann. Statist. 44(5), 1896\u20131930 (2016)","journal-title":"Ann. Statist."},{"issue":"12","key":"9698_CR37","doi-asserted-by":"publisher","first-page":"2982","DOI":"10.1109\/78.476442","volume":"43","author":"G Xu","year":"1995","unstructured":"Xu, G., Liu, H., Tong, L., Kailath, T.: A least-squares approach to blind channel identification. IEEE Trans. Signal Process. 43(12), 2982\u20132993 (1995)","journal-title":"IEEE Trans. Signal Process."}],"container-title":["Advances in Computational Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10444-019-09698-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10444-019-09698-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10444-019-09698-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,28]],"date-time":"2020-04-28T23:29:18Z","timestamp":1588116558000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10444-019-09698-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,4,30]]},"references-count":37,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2019,6]]}},"alternative-id":["9698"],"URL":"https:\/\/doi.org\/10.1007\/s10444-019-09698-6","relation":{},"ISSN":["1019-7168","1572-9044"],"issn-type":[{"value":"1019-7168","type":"print"},{"value":"1572-9044","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,4,30]]},"assertion":[{"value":"26 April 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 January 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 April 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}