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 |
| Issue number | 2 |
| DOIs | |
| Publication status | Published - 2014 Feb |
| Externally published | Yes |
Bibliographical note
Publisher Copyright:© 2014, Springer Science+Business Media New York.
Copyright:
Copyright 2021 Elsevier B.V., All rights reserved.
Subject classification (UKÄ)
- Computational Mathematics
- Computer graphics and computer vision
Free keywords
- Convergence analysis
- Convex optimization
- Domain decomposition
- Image reconstruction
- Pre-dual
- Subspace correction
- Total bounded variation