Recent advances in domain decomposition methods for total variation minimization
From MaRDI portal
Recommendations
- Domain decomposition methods using dual conversion for the total variation minimization with \(L^1\) fidelity term
- Dual-primal domain decomposition methods for the total variation minimization
- Accelerated non-overlapping domain decomposition method for total variation minimization
- Primal domain decomposition methods for the total variation minimization, based on dual decomposition
- A convergent overlapping domain decomposition method for total variation minimization
Cites work
- A convergent overlapping domain decomposition method for total variation minimization
- A dual iterative substructuring method with a penalty term
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A finite element approach for the dual Rudin-Osher-Fatemi model and its nonoverlapping domain decomposition methods
- A finite element nonoverlapping domain decomposition method with Lagrange multipliers for the dual total variation minimizations
- A first-order primal-dual algorithm for convex problems with applications to imaging
- A general framework for a class of first order primal-dual algorithms for convex optimization in imaging science
- A method of finite element tearing and interconnecting and its parallel solution algorithm
- A New Alternating Minimization Algorithm for Total Variation Image Reconstruction
- A Preconditioner for Substructuring Based on Constrained Energy Minimization
- A remark on accelerated block coordinate descent for computing the proximity operators of a sum of convex functions
- A variational approach to remove outliers and impulse noise
- Active contours without edges
- Algorithms for Finding Global Minimizers of Image Segmentation and Denoising Models
- An algorithm for total variation minimization and applications
- An efficient primal-dual method for L^1TV image restoration
- An introduction to continuous optimization for imaging
- Analysis of total variation flow and its finite element approximations
- Aspects of Total Variation RegularizedL1Function Approximation
- Balancing domain decomposition
- Block decomposition methods for total variation by primal-dual stitching
- Bregmanized domain decomposition for image restoration
- Convergence analysis of primal-dual algorithms for a saddle-point problem: from contraction perspective
- Convergence Rate Analysis of a Multiplicative Schwarz Method for Variational Inequalities
- Convergence Rate of a Schwarz Multilevel Method for the Constrained Minimization of Nonquadratic Functionals
- Convergence rate of overlapping domain decomposition methods for the Rudin-Osher-Fatemi model based on a dual formulation
- Convergent non-overlapping domain decomposition methods for variational image segmentation
- Coordinate descent algorithms
- Deep learning
- Discrete total variation with finite elements and applications to imaging
- Domain decomposition methods using dual conversion for the total variation minimization with \(L^1\) fidelity term
- Domain decomposition methods with graph cuts algorithms for total variation minimization
- Edge-preserving and scale-dependent properties of total variation regularization
- Fast nonoverlapping block Jacobi method for the dual Rudin-Osher-Fatemi model
- Global and uniform convergence of subspace correction methods for some convex optimization problems
- scientific article; zbMATH DE number 3868094 (Why is no real title available?)
- scientific article; zbMATH DE number 3564235 (Why is no real title available?)
- scientific article; zbMATH DE number 1313105 (Why is no real title available?)
- scientific article; zbMATH DE number 1376935 (Why is no real title available?)
- scientific article; zbMATH DE number 2098241 (Why is no real title available?)
- scientific article; zbMATH DE number 2113718 (Why is no real title available?)
- scientific article; zbMATH DE number 3227378 (Why is no real title available?)
- Iterative Methods by Space Decomposition and Subspace Correction
- Monotone Operators and the Proximal Point Algorithm
- Non-overlapping domain decomposition methods for dual total variation based image denoising
- Nonlinear total variation based noise removal algorithms
- On the convergence of primal-dual hybrid gradient algorithm
- On the ergodic convergence rates of a first-order primal-dual algorithm
- On the rate of convergence of the proximal alternating linearized minimization algorithm for convex problems
- One- and two-level Schwarz methods for variational inequalities of the second kind and their application to frictional contact
- Oscillating patterns in image processing and nonlinear evolution equations. The fifteenth Dean Jacqueline B. Lewis memorial lectures
- Overlapping domain decomposition methods for total variation denoising
- Primal domain decomposition methods for the total variation minimization, based on dual decomposition
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- Rate of convergence for some constraint decomposition methods for nonlinear variational inequalities
- Signal Recovery by Proximal Forward-Backward Splitting
- 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 _1-minimization
- The Split Bregman Method for L1-Regularized Problems
- Total Bounded Variation Regularization as a Bilaterally Constrained Optimization Problem
- Total variation minimization with finite elements: convergence and iterative solution
Cited in
(20)- Bregmanized domain decomposition for image restoration
- A parallel domain decomposition algorithm for large scale image denoising
- Domain decomposition methods using dual conversion for the total variation minimization with \(L^1\) fidelity term
- 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
- Domain decomposition methods with graph cuts algorithms for image segmentation
- Domain decomposition methods with graph cuts algorithms for total variation minimization
- Overlapping domain decomposition methods for total variation denoising
- Dual-primal domain decomposition methods for the total variation minimization
- Primal domain decomposition methods for the total variation minimization, based on dual decomposition
- Accelerated non-overlapping domain decomposition method for total variation minimization
- An Optimized Dynamic Mode Decomposition Model Robust to Multiplicative Noise
- A two-level domain decomposition method for image restoration
- Fast non-overlapping domain decomposition methods for continuous multi-phase labeling problem
- Domain decomposition for non-smooth (in particular TV) minimization
- Additive Schwarz methods for fourth-order variational inequalities
- Domain decomposition for integer optimal control with total variation regularization
- A convergent overlapping domain decomposition method for total variation minimization
- A general decomposition method for a convex problem related to total variation minimization
This page was built for publication: Recent advances in domain decomposition methods for total variation minimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5149918)
