Accelerated Non-Overlapping Domain Decomposition Method for Total Variation Minimization

DOI10.4208/nmtma.OA-2020-0146MaRDI QIDQ5864761

Yuping Duan, Huibin Chang, Zhenwei Zhang, Xue Li

Publication date: 8 June 2022

Published in: Numerical Mathematics: Theory, Methods and Applications (Search for Journal in Brave)

zbMATH Keywords

total variationnon-overlapping domain decomposition methodprimal-dual algorithmChan-Vese modelRudin-Osher-Fatemi model

Mathematics Subject Classification ID

Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55) Numerical mathematical programming methods (65K05) Numerical optimization and variational techniques (65K10) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Existence theories for problems in abstract spaces (49J27)

Related Items

Additive Schwarz methods for convex optimization with backtracking ⋮ Fast non-overlapping domain decomposition methods for continuous multi-phase labeling problem

Uses Software

• condat_tv

Cites Work

• Nonlinear total variation based noise removal algorithms
• Smooth minimization of non-smooth functions
• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• On the ergodic convergence rates of a first-order primal-dual algorithm
• Domain decomposition methods with graph cuts algorithms for total variation minimization
• A two-level domain decomposition method for image restoration
• A convergent overlapping domain decomposition method for total variation minimization
• An algorithm for total variation minimization and applications
• A first-order primal-dual algorithm for convex problems with applications to imaging
• Bregmanized domain decomposition for image restoration
• Convergent non-overlapping domain decomposition methods for variational image segmentation
• Domain decomposition methods using dual conversion for the total variation minimization with \(L^1\) fidelity term
• 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
• Proximity algorithms for image models: denoising
• Subspace Correction Methods for Total Variation and $\ell_1$-Minimization
• The Split Bregman Method for L1-Regularized Problems
• Algorithms for Finding Global Minimizers of Image Segmentation and Denoising Models
• An Introduction to Domain Decomposition Methods
• Augmented Lagrangian Method, Dual Methods, and Split Bregman Iteration for ROF, Vectorial TV, and High Order Models
• Iterative Methods by Space Decomposition and Subspace Correction
• Active contours without edges
• Fast, robust total variation-based reconstruction of noisy, blurred images
• A primal–dual fixed point algorithm for convex separable minimization with applications to image restoration
• Applications of the Bounded Total Variation Denoising Method to Urban Traffic Analysis
• Fast Nonoverlapping Block Jacobi Method for the Dual Rudin--Osher--Fatemi Model
• RECENT ADVANCES IN DOMAIN DECOMPOSITION METHODS FOR TOTAL VARIATION MINIMIZATION
• Overlapping Domain Decomposition Methods for Total Variation Denoising
• Optimal Primal-Dual Methods for a Class of Saddle Point Problems
• 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