Fast Nonoverlapping Block Jacobi Method for the Dual Rudin--Osher--Fatemi Model
DOI10.1137/18M122604XzbMath1437.65221arXiv1908.01327WikidataQ126585235 ScholiaQ126585235MaRDI QIDQ5109282
Publication date: 11 May 2020
Published in: SIAM Journal on Imaging Sciences (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1908.01327
parallel computation; convergence rate; domain decomposition method; block Jacobi method; Rudin-Osher-Fatemi model; FISTA
65N55: Multigrid methods; domain decomposition for boundary value problems involving PDEs
65K10: Numerical optimization and variational techniques
68U10: Computing methodologies for image processing
65D18: Numerical aspects of computer graphics, image analysis, and computational geometry
65F10: Iterative numerical methods for linear systems
65Y05: Parallel numerical computation
65B99: Acceleration of convergence in numerical analysis
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Nonlinear total variation based noise removal algorithms
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- On the rate of convergence of the proximal alternating linearized minimization algorithm for convex problems
- 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
- 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
- Block decomposition methods for total variation by primal-dual stitching
- 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 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
- A Finite Element Approach for the Dual Rudin--Osher--Fatemi Model and Its Nonoverlapping Domain Decomposition Methods
- A remark on accelerated block coordinate descent for computing the proximity operators of a sum of convex functions
- Convergence Rate of Overlapping Domain Decomposition Methods for the Rudin--Osher--Fatemi Model Based on a Dual Formulation
- Fast Gradient-Based Algorithms for Constrained Total Variation Image Denoising and Deblurring Problems
- On the Convergence of Block Coordinate Descent Type Methods
- Signal Recovery by Proximal Forward-Backward Splitting
- Convex Analysis
- Primal Domain Decomposition Methods for the Total Variation Minimization, Based on Dual Decomposition
- Convergence of a block coordinate descent method for nondifferentiable minimization