Convergence rates and source conditions for Tikhonov regularization with sparsity constraints

By Dirk A. Lorenz. 2008

169 citations recorded by the source corpus.

Abstract This paper addresses the regularization by sparsity constraints by means of weighted ℓ p penalties for 0 ≤ p ≤ 2. For 1 ≤ p ≤ 2 special attention is payed to convergence rates in norm and to source conditions. As main results it is proven that one gets a convergence rate of in the 2-norm for 1 < p ≤ 2 and in the 1-norm for p = 1 as soon as the unknown solution is sparse. The case p = 1 needs a special technique where not only Bregman distances but also a so-called Bregman-Taylor distance has to be employed. For p < 1 only preliminary results are shown. These results indicate that, different from p ≥ 1, the regularizing properties depend on the interplay of the operator and the basis of sparsity. A counterexample for p = 0 shows that regularization need not to happen.

Subfields: Civil and Structural Engineering, Computational Mechanics, Mathematical Physics

View Paper: https://www.semanticscholar.org/paper/80e94abf1923d0496c3e1db984d957609aa92717

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Civil and Structural Engineering

  1. Kristian Bredies
  2. Markus Grasmair
  3. Markus Haltmeier
  4. Daniel Wachsmuth
  5. Gerd Wachsmuth
  6. Otmar Scherzer
  7. Hanna K. Pikkarainen
  8. Peter Maass

In Computational Mechanics

  1. Peter Maass
  2. Bangti Jin
  3. Markus Haltmeier
  4. Otmar Scherzer
  5. Markus Grasmair
  6. Hanna K. Pikkarainen
  7. Kristian Bredies
  8. Daniel Wachsmuth

In Mathematical Physics

  1. Peter Maass
  2. Bangti Jin
  3. Markus Haltmeier
  4. Otmar Scherzer
  5. Markus Grasmair
  6. Hanna K. Pikkarainen
  7. Kristian Bredies
  8. Daniel Wachsmuth

Citations in the corpus