Subspace Correction Methods for Total Variation and $\ell_1$-Minimization
KAUST Grant NumberKUK-I1-007-43
Permanent link to this recordhttp://hdl.handle.net/10754/599796
MetadataShow full item record
AbstractThis paper is concerned with the numerical minimization of energy functionals in Hilbert spaces involving convex constraints coinciding with a seminorm for a subspace. The optimization is realized by alternating minimizations of the functional on a sequence of orthogonal subspaces. On each subspace an iterative proximity-map algorithm is implemented via oblique thresholding, which is the main new tool introduced in this work. We provide convergence conditions for the algorithm in order to compute minimizers of the target energy. Analogous results are derived for a parallel variant of the algorithm. Applications are presented in domain decomposition methods for degenerate elliptic PDEs arising in total variation minimization and in accelerated sparse recovery algorithms based on 1-minimization. We include numerical examples which show e.cient solutions to classical problems in signal and image processing. © 2009 Society for Industrial and Applied Physics.
CitationFornasier M, Schönlieb C-B (2009) Subspace Correction Methods for Total Variation and $\ell_1$-Minimization. SIAM J Numer Anal 47: 3397–3428. Available: http://dx.doi.org/10.1137/070710779.
SponsorsThis work was based on work supported by Award KUK-I1-007-43, made by King Abdullah University of Science and Technology (KAUST).