Abstract
In this paper non-overlapping domain decomposition methods for the pre-dual total variation minimization problem are introduced. Both parallel and sequential approaches are proposed for these methods for which convergence to a minimizer of the original problem is established. The associated subproblems are solved by a semi-smooth Newton method. Several numerical experiments are presented, which show the successful application of the sequential and parallel algorithm for image denoising.
| Original language | English |
|---|---|
| Pages (from-to) | 456–481 |
| Number of pages | 26 |
| Journal | Journal of Scientific Computing |
| Volume | 62 |
| Early online date | 7 May 2014 |
| DOIs | |
| Publication status | Published - Feb 2015 |
| Externally published | Yes |
Keywords
- Domain decomposition
- Subspace correction
- Total bounded variation
- Pre-dual
- Convex optimization
- Convergence analysis
- Image reconstruction