Primal Domain Decomposition Methods for the Total Variation Minimization, Based on Dual Decomposition
From MaRDI portal
Publication:5738159
DOI10.1137/15M1049919zbMath1365.65173MaRDI QIDQ5738159
Publication date: 31 May 2017
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
algorithmdual problemconvergenceconvex optimizationimage processingdomain decompositionparallel computationtotal variation minimizationnumerical result
Convex programming (90C25) Numerical optimization and variational techniques (65K10) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Parallel numerical computation (65Y05) Duality theory (optimization) (49N15) Decomposition methods (49M27)
Related Items (14)
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 ⋮ 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 ⋮ 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 ⋮ Overlapping Domain Decomposition Methods for Ptychographic Imaging ⋮ Accelerated Non-Overlapping Domain Decomposition Method for Total Variation Minimization
Cites Work
- 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
- Image recovery via total variation minimization and related problems
- An algorithm for total variation minimization and applications
- A first-order primal-dual algorithm for convex problems with applications to imaging
- A nonlinear multigrid method for total variation minimization from image restoration
- 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 Singular Value Thresholding Algorithm for Matrix Completion
- 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 Nonlinear Primal-Dual Method for Total Variation-Based Image Restoration
- Total Bounded Variation Regularization as a Bilaterally Constrained Optimization Problem
- Convergence Rate of Overlapping Domain Decomposition Methods for the Rudin--Osher--Fatemi Model Based on a Dual Formulation
- Total Variation Projection With First Order Schemes
- Domain decomposition methods for linear inverse problems with sparsity constraints
- Signal Recovery by Proximal Forward-Backward Splitting
- Convergence of a block coordinate descent method for nondifferentiable minimization
This page was built for publication: Primal Domain Decomposition Methods for the Total Variation Minimization, Based on Dual Decomposition
