Convergence Rate of Overlapping Domain Decomposition Methods for the Rudin--Osher--Fatemi Model Based on a Dual Formulation

DOI10.1137/140965016zbMath1329.94010OpenAlexW2126967844MaRDI QIDQ5250006

Huibin Chang, Danping Yang, Xue-Cheng Tai, Li-Lian Wang

Publication date: 15 May 2015

Published in: SIAM Journal on Imaging Sciences (Search for Journal in Brave)

Full work available at URL: https://hdl.handle.net/10356/107393

zbMATH Keywords

convergence ratedual formulationsuccessive subspace correctionparallel subspace correctionRudin-Osher-Fatemi modeloverlapping domain decomposition method

Mathematics Subject Classification ID

Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Finite difference methods applied to problems in solid mechanics (74S20)

Related Items

Additive Schwarz methods for convex optimization with backtracking, Dual-Primal Domain Decomposition Methods for the Total Variation Minimization, Block decomposition methods for total variation by primal-dual stitching, Accelerated additive Schwarz methods for convex optimization with adaptive restart, Domain decomposition methods using dual conversion for the total variation minimization with \(L^1\) fidelity term, Fast non-overlapping domain decomposition methods for continuous multi-phase labeling problem, Fast Nonoverlapping Block Jacobi Method for the Dual Rudin--Osher--Fatemi Model, Shrinking gradient descent algorithms for total variation regularized image denoising, Additive Schwarz Methods for Convex Optimization as Gradient Methods, An overlapping domain decomposition framework without dual formulation for variational imaging problems, A Finite Element Approach for the Dual Rudin--Osher--Fatemi Model and Its Nonoverlapping Domain Decomposition Methods, An efficient multi-grid method for TV minimization problems, Primal Domain Decomposition Methods for the Total Variation Minimization, Based on Dual Decomposition, Convergent non-overlapping domain decomposition methods for variational image segmentation, A parallel domain decomposition algorithm for large scale image denoising, Pseudo-linear convergence of an additive Schwarz method for dual total variation minimization, A finite element nonoverlapping domain decomposition method with Lagrange multipliers for the dual total variation minimizations, RECENT ADVANCES IN DOMAIN DECOMPOSITION METHODS FOR TOTAL VARIATION MINIMIZATION, Overlapping Domain Decomposition Methods for Total Variation Denoising, Phase Retrieval from Incomplete Magnitude Information via Total Variation Regularization, Overlapping Domain Decomposition Methods for Ptychographic Imaging, Accelerated Non-Overlapping Domain Decomposition Method for Total Variation Minimization

Uses Software

• RecPF

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• Domain decomposition methods with graph cuts algorithms for total variation minimization
• Domain decomposition methods for nonlocal total variation image restoration
• 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
• Rate of convergence for some constraint decomposition methods for nonlinear variational inequalities
• On the abstract theory of additive and multiplicative Schwarz algorithms
• A first-order primal-dual algorithm for convex problems with applications to imaging
• Bregmanized domain decomposition for image restoration
• Domain decomposition methods in image denoising using Gaussian curvature
• Non-overlapping domain decomposition methods for dual total variation based image denoising
• Domain decomposition method for image deblurring
• Globally optimal geodesic active contours
• Global and uniform convergence of subspace correction methods for some convex optimization problems
• Subspace Correction Methods for a Class of Nonsmooth and Nonadditive Convex Variational Problems with Mixed $L^1/L^2$ Data-Fidelity in Image Processing
• Subspace Correction Methods for Total Variation and $\ell_1$-Minimization
• A General Framework for a Class of First Order Primal-Dual Algorithms for Convex Optimization in Imaging Science
• A New Alternating Minimization Algorithm for Total Variation Image Reconstruction
• The Split Bregman Method for L1-Regularized Problems
• Augmented Lagrangian Method, Dual Methods, and Split Bregman Iteration for ROF, Vectorial TV, and High Order Models
• Augmented Lagrangian Method, Dual Methods and Split Bregman Iteration for ROF Model
• Handbook of Mathematical Methods in Imaging
• An Efficient Primal-Dual Method for $L^1$TV Image Restoration
• Iterative Methods by Space Decomposition and Subspace Correction
• Rate of Convergence of Some Space Decomposition Methods for Linear and Nonlinear Problems
• Analysis of bounded variation penalty methods for ill-posed problems
• Fast, robust total variation-based reconstruction of noisy, blurred images
• Explicit Algorithms for a New Time Dependent Model Based on Level Set Motion for Nonlinear Deblurring and Noise Removal
• Convergence rate analysis of an asynchronous space decomposition method for convex Minimization
• Computational Methods for Inverse Problems
• Finite Element Methods for Maxwell's Equations
• Total Bounded Variation Regularization as a Bilaterally Constrained Optimization Problem
• Iterative Methods for Total Variation Denoising
• An Infeasible Primal-Dual Algorithm for Total Bounded Variation--Based Inf-Convolution-Type Image Restoration
• An Iterative Regularization Method for Total Variation-Based Image Restoration