Pseudo-linear convergence of an additive Schwarz method for dual total variation minimization

DOI10.1553/etna_vol54s176zbMath1473.65342arXiv1911.06639OpenAlexW2988902853MaRDI QIDQ2033682

Jong Ho Park

Publication date: 17 June 2021

Published in: ETNA. Electronic Transactions on Numerical Analysis (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1911.06639

zbMATH Keywords

convergence ratedomain decomposition methodtotal variation minimizationadditive Schwarz methodRudin-Osher-Fatemi model

Mathematics Subject Classification ID

Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55) Stability and convergence of numerical methods for boundary value problems involving PDEs (65N12) Parallel numerical computation (65Y05)

Related Items (3)

Additive Schwarz methods for convex optimization with backtracking ⋮ Accelerated additive Schwarz methods for convex optimization with adaptive restart ⋮ Fast gradient methods for uniformly convex and weakly smooth problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Nonlinear total variation based noise removal algorithms
• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• A convergent overlapping domain decomposition method for total variation minimization
• An algorithm for total variation minimization and applications
• Rate of convergence for some constraint decomposition methods for nonlinear variational inequalities
• A finite element nonoverlapping domain decomposition method with Lagrange multipliers for the dual total variation minimizations
• Discrete total variation with finite elements and applications to imaging
• One- and two-level Schwarz methods for variational inequalities of the second kind and their application to frictional contact
• Non-overlapping domain decomposition methods for dual total variation based image denoising
• Global and uniform convergence of subspace correction methods for some convex optimization problems
• On the Convergence of Alternating Minimization for Convex Programming with Applications to Iteratively Reweighted Least Squares and Decomposition Schemes
• Subspace Correction Methods for Total Variation and $\ell_1$-Minimization
• Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions
• Cahn–Hilliard Inpainting and a Generalization for Grayvalue Images
• Image Decomposition and Restoration Using Total Variation Minimization and theH¹
• Convergence Rate Analysis of a Multiplicative Schwarz Method for Variational Inequalities
• A Finite Element Approach for the Dual Rudin--Osher--Fatemi Model and Its Nonoverlapping Domain Decomposition Methods
• An Overlapping Schwarz Algorithm for Raviart--Thomas Vector Fields with Discontinuous Coefficients
• A remark on accelerated block coordinate descent for computing the proximity operators of a sum of convex functions
• Fast Nonoverlapping Block Jacobi Method for the Dual Rudin--Osher--Fatemi Model
• Overlapping Domain Decomposition Methods for Total Variation Denoising
• Convergence Rate of Overlapping Domain Decomposition Methods for the Rudin--Osher--Fatemi Model Based on a Dual Formulation
• Primal Domain Decomposition Methods for the Total Variation Minimization, Based on Dual Decomposition
• An introduction to continuous optimization for imaging

This page was built for publication: Pseudo-linear convergence of an additive Schwarz method for dual total variation minimization