{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,8]],"date-time":"2026-10-08T06:45:44Z","timestamp":1791441944539,"version":"4.3.3"},"reference-count":41,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Numer. Anal."],"published-print":{"date-parts":[[2008,1]]},"abstract":"<jats:p>Vector-valued data appearing in concrete applications often possess sparse expansions with respect to a preassigned frame for each vector component individually. Additionally, different components may also exhibit common sparsity patterns. Recently, there were introduced sparsity measures that take into account such joint sparsity patterns, promoting coupling of nonvanishing components. These measures are typically constructed as weighted $\\ell_1$ norms of componentwise $\\ell_q$ norms of frame coefficients. We show how to compute solutions of linear inverse problems with such joint sparsity regularization constraints by fast thresholded Landweber algorithms. Next we discuss the adaptive choice of suitable weights appearing in the definition of sparsity measures. The weights are interpreted as indicators of the sparsity pattern and are iteratively updated after each new application of the thresholded Landweber algorithm. The resulting two-step algorithm is interpreted as a double-minimization scheme for a suitable target functional. We show its $\\ell_2$-norm convergence. An implementable version of the algorithm is also formulated, and its norm convergence is proven. Numerical experiments in color image restoration are presented.<\/jats:p>","DOI":"10.1137\/0606668909","type":"journal-article","created":{"date-parts":[[2008,2,4]],"date-time":"2008-02-04T11:37:29Z","timestamp":1202125049000},"page":"577-613","source":"Crossref","is-referenced-by-count":159,"title":["Recovery Algorithms for Vector-Valued Data with Joint Sparsity Constraints"],"prefix":"10.1137","volume":"46","author":[{"given":"Massimo","family":"Fornasier","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Holger","family":"Rauhut","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2008,2,1]]},"reference":[{"key":"R1","doi-asserted-by":"publisher","DOI":"10.1002\/cpa.3160430805"},{"key":"R2","unstructured":"S. Anthoine,\n                      Different Wavelet-based Approaches for the Separation of Noisy and Blurred Mixtures of Components. Application to Astrophysical Data\n                      , Ph.D. thesis, Princeton University, Princeton, NJ, 2005."},{"key":"R3","unstructured":"D. Baron, M. B. Wakin, M. F. Duarte, S. Sarvotham, and R. G. Baraniuk,\n                      Distributed Compressed Sensing\n                      , preprint, 2005."},{"key":"R4","doi-asserted-by":"crossref","unstructured":"S. Boyd and L. Vandenberghe,\n                      Convex Optimization\n                      , Cambridge University Press, Cambridge, 2004.","DOI":"10.1017\/CBO9780511804441"},{"key":"R5","doi-asserted-by":"publisher","DOI":"10.1023\/A:1022895410391"},{"key":"R6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.885507"},{"key":"R7","doi-asserted-by":"crossref","unstructured":"E. J. Cand\u00e8s, L. Demanet, D. L. Donoho, and L. Ying,\n                      Fast Discrete Curvelet Transforms\n                      , 2005.","DOI":"10.1137\/05064182X"},{"key":"R8","doi-asserted-by":"publisher","DOI":"10.1002\/cpa.10116"},{"key":"R9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.862083"},{"key":"R10","doi-asserted-by":"publisher","DOI":"10.1137\/S0036142903429730"},{"key":"R11","doi-asserted-by":"crossref","unstructured":"O. Christensen,\n                      An Introduction to Frames and Riesz Bases\n                      , Birkh\u00e4user, Boston, 2003.","DOI":"10.1007\/978-0-8176-8224-8"},{"key":"R12","unstructured":"A. Cohen,\n                      Numerical Analysis of Wavelet Methods\n                      , Stud. Math. Appl., 32, North-Holland, Amsterdam, 2003."},{"key":"R13","doi-asserted-by":"publisher","DOI":"10.1137\/S0036142902411793"},{"key":"R14","doi-asserted-by":"publisher","DOI":"10.1007\/s10444-005-7501-6"},{"key":"R15","doi-asserted-by":"publisher","DOI":"10.1093\/imanum\/drl035"},{"key":"R16","doi-asserted-by":"crossref","unstructured":"S. Dahlke and P. Maass,\n                      An outline of adaptive wavelet Galerkin methods for Tikhonov regularization of inverse parabolic problems\n                      , Recent Development in Theories and Numerics. Proceedings of the International Conference on Inverse Problems, Y.C. Hon et al., eds., Hong Kong, China, 2002, World Scientific, River Edge, NJ, pp. 56\u201366, 2003.","DOI":"10.1142\/9789812704924_0006"},{"key":"R17","doi-asserted-by":"publisher","DOI":"10.1002\/cpa.20042"},{"key":"R18","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2004.12.004"},{"key":"R19","doi-asserted-by":"publisher","DOI":"10.3934\/ipi.2007.1.29"},{"key":"R20","doi-asserted-by":"publisher","DOI":"10.1137\/0523074"},{"key":"R21","doi-asserted-by":"publisher","DOI":"10.1109\/18.382009"},{"key":"R22","doi-asserted-by":"publisher","DOI":"10.1006\/acha.1995.1008"},{"key":"R23","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.871582"},{"key":"R24","doi-asserted-by":"crossref","unstructured":"I. Ekeland and R. T\u00e9mam,\n                      Convex Analysis and Variational Problems\n                      , SIAM, Philadelphia, 1999.","DOI":"10.1137\/1.9781611971088"},{"key":"R25","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2005.03.005"},{"key":"R26","doi-asserted-by":"crossref","unstructured":"H. W. Engl, M. Hanke, and A. Neubauer,\n                      Regularization of Inverse Problems\n                      , Math. Appl. 375, Kluwer Academic Publishers, Dordrecht, 1996.","DOI":"10.1007\/978-94-009-1740-8"},{"key":"R27","unstructured":"M. Fornasier and H. Rauhut,\n                      Iterative thresholding algorithms\n                      , Appl. Comput. Harmon. Anal., to appear."},{"key":"R28","unstructured":"M. Fornasier and D. Toniolo,\n                      Computer-based recomposition of the frescoes in the Ovetari Chapel in the Church of the Eremitani in Padua. Methodology and initial results\n                      , in Mantegna nella chiesa degli Eremitani a Padova. Il recupero possibile, Skira, ed., 2003 (English\/Italian)."},{"key":"R29","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2005.03.014"},{"key":"R30","doi-asserted-by":"publisher","DOI":"10.1016\/j.sigpro.2005.05.030"},{"key":"R31","doi-asserted-by":"publisher","DOI":"10.1007\/s00041-004-0946-z"},{"key":"R32","first-page":"29","volume":"21","author":"Jaffard S.","year":"2005","journal-title":"Constr. Approx.","ISSN":"https:\/\/id.crossref.org\/issn\/0176-4276","issn-type":"print"},{"key":"R33","unstructured":"S. Kunis and H. Rauhut,\n                      Random sampling of sparse trigonometric polynomials II\u2014orthogonal matching pursuit versus basis pursuit\n                      , Found. Comput. Math., to appear."},{"key":"R34","doi-asserted-by":"crossref","unstructured":"S. Mallat,\n                      A Wavelet Tour of Signal Processing\n                      , 2nd ed., Academic Press, San Diego, CA, 1999.","DOI":"10.1016\/B978-012466606-1\/50008-8"},{"key":"R35","doi-asserted-by":"publisher","DOI":"10.1002\/cpa.3160420503"},{"key":"R36","doi-asserted-by":"publisher","DOI":"10.1088\/0266-5611\/21\/5\/005"},{"key":"R37","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2006.05.002"},{"key":"R38","doi-asserted-by":"crossref","unstructured":"R. T. Rockafellar and R. J. B. Wets,\n                      Variational Analysis\n                      , Grundlehren Math. Wiss., 317, Springer-Verlag, Berlin, 1998.","DOI":"10.1007\/978-3-642-02431-3"},{"key":"R39","doi-asserted-by":"publisher","DOI":"10.1137\/S0036142902407988"},{"key":"R40","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2006.05.003"},{"key":"R41","doi-asserted-by":"publisher","DOI":"10.1016\/j.sigpro.2005.05.031"}],"container-title":["SIAM Journal on Numerical Analysis"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/0606668909","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T15:11:34Z","timestamp":1787325094000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/0606668909"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,1]]},"references-count":41,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2008,1]]}},"alternative-id":["10.1137\/0606668909"],"URL":"https:\/\/doi.org\/10.1137\/0606668909","relation":{},"ISSN":["0036-1429","1095-7170"],"issn-type":[{"value":"0036-1429","type":"print"},{"value":"1095-7170","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,1]]}}}