{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:41:29Z","timestamp":1740123689147,"version":"3.37.3"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2022,12,8]],"date-time":"2022-12-08T00:00:00Z","timestamp":1670457600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,12,8]],"date-time":"2022-12-08T00:00:00Z","timestamp":1670457600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"the National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["61901404"],"award-info":[{"award-number":["61901404"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"the National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["12031003"],"award-info":[{"award-number":["12031003"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"the National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["11771347"],"award-info":[{"award-number":["11771347"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"the Nanhu Scholars Program for Young Scholars of XYNU","award":["the Nanhu Scholars Program for Young Scholars of XYNU"],"award-info":[{"award-number":["the Nanhu Scholars Program for Young Scholars of XYNU"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Numer Algor"],"published-print":{"date-parts":[[2023,6]]},"DOI":"10.1007\/s11075-022-01441-5","type":"journal-article","created":{"date-parts":[[2022,12,8]],"date-time":"2022-12-08T04:29:27Z","timestamp":1670473767000},"page":"785-813","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["DCACO: an algorithm for designing incoherent redundant matrices"],"prefix":"10.1007","volume":"93","author":[{"given":"Yongchao","family":"Yu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jigen","family":"Peng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,12,8]]},"reference":[{"issue":"3","key":"1441_CR1","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1016\/S1063-5203(03)00023-X","volume":"14","author":"T Strohmer","year":"2003","unstructured":"Strohmer, T., Heath, Jr.R.W.: Grassmannian frames with applications to coding and communication. Appl. Comput. Harmon. Anal. 14(3), 257\u2013275 (2003)","journal-title":"Appl. Comput. Harmon. Anal."},{"issue":"24","key":"1441_CR2","doi-asserted-by":"publisher","first-page":"6606","DOI":"10.1109\/TSP.2015.2477052","volume":"63","author":"H Z\u00f6rlein","year":"2015","unstructured":"Z\u00f6rlein, H., Bossert, M.: Coherence optimization and best complex antipodal spherical codes. IEEE Trans. Signal Process. 63(24), 6606\u20136615 (2015)","journal-title":"IEEE Trans. Signal Process."},{"issue":"3","key":"1441_CR3","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1006\/acha.2000.0340","volume":"10","author":"VK Goyal","year":"2001","unstructured":"Goyal, V. K., Kova\u010devi\u0107, J., Kelner, J. A.: Quantized frame expansions with erasures. Appl. Comput. Harmon. Anal. 10(3), 203\u2013233 (2001)","journal-title":"Appl. Comput. Harmon. Anal."},{"issue":"10","key":"1441_CR4","doi-asserted-by":"publisher","first-page":"2231","DOI":"10.1109\/TIT.2004.834793","volume":"50","author":"JA Tropp","year":"2004","unstructured":"Tropp, J. A.: Greed is good: Algorithmic results for sparse approximation. IEEE Trans. Inf. Theory 50(10), 2231\u20132242 (2004)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1441_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-7011-4","volume-title":"Sparse and Redundant Representations: From Theory to Applications in Signal and Image Processing","author":"M Elad","year":"2010","unstructured":"Elad, M.: Sparse and Redundant Representations: From Theory to Applications in Signal and Image Processing. Springer, New York (2010)"},{"key":"1441_CR6","doi-asserted-by":"crossref","unstructured":"Foucart, S., Rauhut, H.: A mathematical introduction to compressive sensing birkh\u00e4user Basel (2013)","DOI":"10.1007\/978-0-8176-4948-7"},{"key":"1441_CR7","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511794308","volume-title":"Compressed Sensing: Theory and Applications","author":"YC Eldar","year":"2012","unstructured":"Eldar, Y. C., Kutyniok, G.: Compressed Sensing: Theory and Applications. Cambridge Univ. Press, Cambridge (2012)"},{"issue":"12","key":"1441_CR8","doi-asserted-by":"publisher","first-page":"5695","DOI":"10.1109\/TSP.2007.900760","volume":"55","author":"M Elad","year":"2007","unstructured":"Elad, M.: Optimized projections for compressed sensing. IEEE Trans. Signal Process. 55(12), 5695\u20135702 (2007)","journal-title":"IEEE Trans. Signal Process."},{"issue":"1","key":"1441_CR9","doi-asserted-by":"publisher","first-page":"560349","DOI":"10.1155\/2010\/560349","volume":"2010","author":"J Xu","year":"2010","unstructured":"Xu, J., Pi, Y., Cao, Z.: Optimized projection matrix for compressive sensing. EURASIP J. Adv. Signal Process. 2010(1), 560349 (2010)","journal-title":"EURASIP J. Adv. Signal Process."},{"key":"1441_CR10","doi-asserted-by":"publisher","first-page":"999","DOI":"10.1016\/j.sigpro.2011.10.012","volume":"92","author":"V Abolghasemi","year":"2012","unstructured":"Abolghasemi, V., Ferdowsi, S., Sanei, S.: A gradient-based alternating minimization approach for optimization of the measurement matrix in compressive sensing. Signal Process. 92, 999\u20131009 (2012)","journal-title":"Signal Process."},{"issue":"4","key":"1441_CR11","doi-asserted-by":"publisher","first-page":"2319","DOI":"10.1109\/TIT.2014.2308171","volume":"60","author":"EV Tsiligianni","year":"2014","unstructured":"Tsiligianni, E. V., Kondi, L. P., Katsaggelos, A. K.: Construction of incoherent unit norm tight frames with application to compressed sensing. IEEE Trans. Inf. Theory 60(4), 2319\u20132330 (2014)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"9","key":"1441_CR12","doi-asserted-by":"publisher","first-page":"2334","DOI":"10.1109\/TSP.2016.2521607","volume":"64","author":"C Rusu","year":"2016","unstructured":"Rusu, C., Gonz\u00e1lez-Prelcic, N.: Designing incoherent frames through convex techniques for optimized compressed sensing. IEEE Trans. Signal Process. 64(9), 2334\u20132344 (2016)","journal-title":"IEEE Trans. Signal Process."},{"key":"1441_CR13","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/j.sigpro.2018.04.020","volume":"151","author":"C Lu","year":"2018","unstructured":"Lu, C., Li, H., Lin, Z.: Optimized projections for compressed sensing via direct mutual coherence minimization. Signal Process. 151, 45\u201355 (2018)","journal-title":"Signal Process."},{"key":"1441_CR14","doi-asserted-by":"crossref","unstructured":"Casazza, P. G., Kutyniok, G.: Finite frames: theory and applications birkh\u00e4user Basel (2013)","DOI":"10.1007\/978-0-8176-8373-3"},{"issue":"1","key":"1441_CR15","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1016\/j.acha.2011.09.005","volume":"33","author":"WU Bajwa","year":"2012","unstructured":"Bajwa, W. U., Calderbank, R., Mixon, D. G.: Two are better than one: fundamental parameters of frame coherence. Appl. Comput. Harmon. Anal. 33(1), 58\u201378 (2012)","journal-title":"Appl. Comput. Harmon. Anal."},{"key":"1441_CR16","doi-asserted-by":"crossref","unstructured":"Waldron, S. F. D.: An introduction to finite tight frames birkh\u00e4user Basel (2018)","DOI":"10.1007\/978-0-8176-4815-2"},{"issue":"1","key":"1441_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00041-020-09790-2","volume":"27","author":"X Chen","year":"2021","unstructured":"Chen, X., Hardin, D. P., Saff, E. B.: On the search for tight frames of low coherence. J. Fourier Anal. Appl. 27(1), 1\u201327 (2021)","journal-title":"J. Fourier Anal. Appl."},{"issue":"3","key":"1441_CR18","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1109\/TIT.1974.1055219","volume":"20","author":"LR Welch","year":"1974","unstructured":"Welch, L. R: Lower bounds on the maximum cross correlation of signals. IEEE Trans. Inf. Theory 20(3), 397\u2013399 (1974)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"5","key":"1441_CR19","doi-asserted-by":"publisher","first-page":"1900","DOI":"10.1109\/TIT.2005.846411","volume":"51","author":"P Xia","year":"2005","unstructured":"Xia, P., Zhou, S., Giannakis, G. B.: Achieving the Welch bound with difference sets. IEEE Trans. Inf. Theory 51(5), 1900\u20131907 (2005)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1441_CR20","doi-asserted-by":"publisher","first-page":"619","DOI":"10.1016\/j.laa.2007.05.043","volume":"426","author":"MA Sustik","year":"2007","unstructured":"Sustik, M. A., Tropp, J. A., Dhillon, I. S., Heath, JrR. W.: On the existence of equiangular tight frames. Linear Algebra Appl. 426, 619\u2013635 (2007)","journal-title":"Linear Algebra Appl."},{"key":"1441_CR21","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1016\/j.laa.2007.05.029","volume":"426","author":"JM Renes","year":"2007","unstructured":"Renes, J. M.: Equiangular tight frames from paley tournaments. Linear Algebra Appl. 426, 497\u2013501 (2007)","journal-title":"Linear Algebra Appl."},{"issue":"11","key":"1441_CR22","doi-asserted-by":"publisher","first-page":"2228","DOI":"10.1016\/j.laa.2009.07.016","volume":"431","author":"SFD Waldron","year":"2009","unstructured":"Waldron, S. F. D.: On the construction of equiangular frames from graphs. Linear Algebra Appl. 431(11), 2228\u20132242 (2009)","journal-title":"Linear Algebra Appl."},{"issue":"5","key":"1441_CR23","doi-asserted-by":"publisher","first-page":"1014","DOI":"10.1016\/j.laa.2011.06.027","volume":"436","author":"M Fickus","year":"2012","unstructured":"Fickus, M., Mixon, D. G., Tremain, J. C.: Steiner equiangular tight frames. Linear Algebra Appl. 436(5), 1014\u20131027 (2012)","journal-title":"Linear Algebra Appl."},{"issue":"1","key":"1441_CR24","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1109\/TIT.2013.2285565","volume":"60","author":"J Jasper","year":"2014","unstructured":"Jasper, J., Mixon, D. G., Fickus, M.: Kirkman equiangular tight frames and codes. IEEE Trans. Inf. Theory 60(1), 170\u2013181 (2014)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1441_CR25","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/j.laa.2016.06.038","volume":"508","author":"C Rusu","year":"2016","unstructured":"Rusu, C., Gonz\u00e1lez-Prelcic, N., Heath, JrR. W.: Properties of real and complex ETFs and their application to the design of low coherence frames. Linear Algebra Appl. 508, 81\u201390 (2016)","journal-title":"Linear Algebra Appl."},{"key":"1441_CR26","doi-asserted-by":"crossref","unstructured":"Fickus, M., Mixon, D. G.: Tables of the existence of equiangular tight frames. https:\/\/arxiv.org\/abs\/1504.00253 (2016)","DOI":"10.1109\/SAMPTA.2015.7148910"},{"issue":"1","key":"1441_CR27","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1109\/TIT.2004.839492","volume":"51","author":"JA Tropp","year":"2005","unstructured":"Tropp, J. A., Dhillon, I. S., Heath, R. W., Strohmer, T.: Designing structured tight frames via an alternating projection method. IEEE Trans. Inf. Theory 51(1), 188\u2013209 (2005)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1441_CR28","unstructured":"Thill, M., Hassibi, B.: Low-coherence frames from group fourier matrices. https:\/\/arxiv.org\/abs\/1509.05739 (2015)"},{"issue":"7","key":"1441_CR29","doi-asserted-by":"publisher","first-page":"673","DOI":"10.1109\/LSP.2013.2263280","volume":"20","author":"C Rusu","year":"2013","unstructured":"Rusu, C.: Design of incoherent frames via convex optimization. IEEE Signal Process. Lett. 20(7), 673\u2013676 (2013)","journal-title":"IEEE Signal Process. Lett."},{"issue":"1","key":"1441_CR30","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1109\/LSP.2016.2632199","volume":"24","author":"M Sadeghi","year":"2017","unstructured":"Sadeghi, M., Babaie-Zadeh, M.: Incoherent unit-norm frame design via an alternating minimization penalty method. IEEE Signal Process. Lett. 24(1), 32\u201336 (2017)","journal-title":"IEEE Signal Process. Lett."},{"issue":"9","key":"1441_CR31","doi-asserted-by":"publisher","first-page":"1265","DOI":"10.1109\/LSP.2017.2723044","volume":"24","author":"B Dumitrescu","year":"2017","unstructured":"Dumitrescu, B.: Designing incoherent frames with only matrix-vector multiplications. IEEE Signal Process. Lett. 24(9), 1265\u20131269 (2017)","journal-title":"IEEE Signal Process. Lett."},{"issue":"2","key":"1441_CR32","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1017\/S0305004100051070","volume":"77","author":"CM Theobald","year":"1975","unstructured":"Theobald, C. M.: An inequality for the trace of the product of two symmetric matrices. Math. Proc. Cambridge Philos. Soc. 77(2), 265\u2013267 (1975)","journal-title":"Math. Proc. Cambridge Philos. Soc."},{"key":"1441_CR33","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-48311-5","volume-title":"Convex Analysis and Monotone Operator Theory in Hilbert Spaces, 2nd edn.","author":"HH Bauschke","year":"2017","unstructured":"Bauschke, H. H., Combettes, P. L.: Convex Analysis and Monotone Operator Theory in Hilbert Spaces, 2nd edn. Springer, New York (2017)"},{"issue":"1","key":"1441_CR34","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/s10107-018-1235-y","volume":"169","author":"HAL Thi","year":"2018","unstructured":"Thi, H. A. L., Dinh, T. P.: DC programming and DCA: thirty years of developments. Math. Program. 169(1), 5\u201368 (2018)","journal-title":"Math. Program."},{"key":"1441_CR35","doi-asserted-by":"crossref","unstructured":"Duchi, J., Shalev-Shwartz, S., Singer, Y., Chandra, T.: Efficient projections onto the \u21131-ball for learning in high dimensions. Proc. 25th ICML:272\u2013279 (2008)","DOI":"10.1145\/1390156.1390191"},{"key":"1441_CR36","unstructured":"Grant, M., Boyd, S.: CVX: matlab software for disciplined convex programming, version 2.0 beta. http:\/\/cvxr.com\/cvx (2013)"},{"key":"1441_CR37","doi-asserted-by":"crossref","unstructured":"Grant, M., Boyd, S.: Graph implementations for nonsmooth convex programs. Recent advances in learning and control (a tribute to M. Vidyasagar). In: Blondel, V., Boyd, S., Kimura, H. (eds.) Lecture Notes in Control and Information Sciences, pp. 95\u2013110. Springer. http:\/\/stanford.edu\/boyd\/graph_dcp.html (2008)","DOI":"10.1007\/978-1-84800-155-8_7"},{"issue":"1","key":"1441_CR38","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1007\/s10851-010-0251-1","volume":"40","author":"A Chamboulle","year":"2011","unstructured":"Chamboulle, A., Pock, T.: A first-order primal-dual algorithm for convex problems with applications to imaging. J. Math. Imag. Vis. 40(1), 120\u2013145 (2011)","journal-title":"J. Math. Imag. Vis."}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-022-01441-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11075-022-01441-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-022-01441-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,8]],"date-time":"2023-05-08T05:11:08Z","timestamp":1683522668000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11075-022-01441-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,12,8]]},"references-count":38,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,6]]}},"alternative-id":["1441"],"URL":"https:\/\/doi.org\/10.1007\/s11075-022-01441-5","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"type":"print","value":"1017-1398"},{"type":"electronic","value":"1572-9265"}],"subject":[],"published":{"date-parts":[[2022,12,8]]},"assertion":[{"value":"25 January 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 October 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 December 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"<!--Emphasis Type='Bold' removed-->Conflict of interest"}}]}}