Multigrid methods for total variation (Q6908301)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 8113699
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Multigrid methods for total variation |
scientific article; zbMATH DE number 8113699 |
Statements
Multigrid methods for total variation (English)
0 references
31 October 2025
0 references
In this interesting paper the authors study multigrid methods for total variation. To set the scene, the authors study composite optimization problems of the form: \(\min_{x\in X}(F(x)+G(x))\), where \(F\) is convex and also smooth and \(G\) is convex but also possibily nonsmooth on a Hilbert space \(X\). Based on a nonsmooth coherence condition the authors construct and prove the convergence of a forward-backward splitting method for several optimization problems of the type above. The method alternates between steps on a fine and a coarse grid, which is often used to solve numerous partial differential equations. The authors focus on total variation regularized inverse imaging problems, specifically their dual problems. The problems are chosen so that the authors are able to develop the relevant coarse-grid problems. The authors demonstrate numerically the performance of their methods on magnetic resonance imaging and variation denoising.\N\NThe paper is well written with a good set of references.\N\NFor the entire collection see [Zbl 1573.68017].
0 references
multigrid
0 references
total variation
0 references
optimization
0 references
forward-backward splitting
0 references
denoising
0 references
0 references
0 references
0 references
0 references