RECENT ADVANCES IN DOMAIN DECOMPOSITION METHODS FOR TOTAL VARIATION MINIMIZATION (Q5149918): Difference between revisions

From MaRDI portal

Jump to:navigation, search

Latest revision as of 17:08, 30 December 2024

scientific article; zbMATH DE number 7307928

Language	Label	Description	Also known as
English	RECENT ADVANCES IN DOMAIN DECOMPOSITION METHODS FOR TOTAL VARIATION MINIMIZATION	scientific article; zbMATH DE number 7307928

Statements

scholarly article

0 references

0 references

0 references

publication date

9 February 2021

0 references

zbMATH Keywords

domain decomposition methods

0 references

total variation

0 references

mathematical imaging

0 references

parallel computation

0 references

describes a project that uses

0 references

MaRDI profile type

0 references

full work available at URL

http://www.koreascience.or.kr:80/article/JAKO202019854294101.pdf

0 references

RECENT ADVANCES IN DOMAIN DECOMPOSITION METHODS FOR TOTAL VARIATION MINIMIZATION (English)

0 references

0 references

0 references

Iterative Methods by Space Decomposition and Subspace Correction

0 references

A Preconditioner for Substructuring Based on Constrained Energy Minimization

0 references

Balancing domain decomposition

0 references

0 references

A method of finite element tearing and interconnecting and its parallel solution algorithm

0 references

A dual iterative substructuring method with a penalty term

0 references

Nonlinear total variation based noise removal algorithms

0 references

Edge-preserving and scale-dependent properties of total variation regularization

0 references

An algorithm for total variation minimization and applications

0 references

A New Alternating Minimization Algorithm for Total Variation Image Reconstruction

0 references

A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems

0 references

The Split Bregman Method for L1-Regularized Problems

0 references

A first-order primal-dual algorithm for convex problems with applications to imaging

0 references

A General Framework for a Class of First Order Primal-Dual Algorithms for Convex Optimization in Imaging Science

0 references

Convergence Rate of a Schwarz Multilevel Method for the Constrained Minimization of Nonquadratic Functionals

0 references

One- and two-level Schwarz methods for variational inequalities of the second kind and their application to frictional contact

0 references

Global and uniform convergence of subspace correction methods for some convex optimization problems

0 references

A convergent overlapping domain decomposition method for total variation minimization

0 references

Subspace Correction Methods for Total Variation and $\ell_1$-Minimization

0 references

Subspace Correction Methods for a Class of Nonsmooth and Nonadditive Convex Variational Problems with Mixed $L^1/L^2$ Data-Fidelity in Image Processing

0 references

Domain decomposition methods with graph cuts algorithms for total variation minimization

0 references

Bregmanized domain decomposition for image restoration

0 references

Block decomposition methods for total variation by primal-dual stitching

0 references

Primal Domain Decomposition Methods for the Total Variation Minimization, Based on Dual Decomposition

0 references

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

0 references

Non-overlapping domain decomposition methods for dual total variation based image denoising

0 references

Fast Nonoverlapping Block Jacobi Method for the Dual Rudin--Osher--Fatemi Model

0 references

A Finite Element Approach for the Dual Rudin--Osher--Fatemi Model and Its Nonoverlapping Domain Decomposition Methods

0 references

A finite element nonoverlapping domain decomposition method with Lagrange multipliers for the dual total variation minimizations

0 references

Convergent non-overlapping domain decomposition methods for variational image segmentation

0 references

Algorithms for Finding Global Minimizers of Image Segmentation and Denoising Models

0 references

Active contours without edges

0 references

Domain decomposition methods using dual conversion for the total variation minimization with \(L^1\) fidelity term

0 references

Aspects of Total Variation Regularized<i>L</i><sup>1</sup>Function Approximation

0 references

0 references

0 references

Analysis of total variation flow and its finite element approximations

0 references

An introduction to continuous optimization for imaging

0 references

0 references

A variational approach to remove outliers and impulse noise

0 references

0 references

An Efficient Primal-Dual Method for $L^1$TV Image Restoration

0 references

Total Bounded Variation Regularization as a Bilaterally Constrained Optimization Problem

0 references

Convergence Rate Analysis of a Multiplicative Schwarz Method for Variational Inequalities

0 references

Rate of convergence for some constraint decomposition methods for nonlinear variational inequalities

0 references

Proximal alternating linearized minimization for nonconvex and nonsmooth problems

0 references

A remark on accelerated block coordinate descent for computing the proximity operators of a sum of convex functions

0 references

On the rate of convergence of the proximal alternating linearized minimization algorithm for convex problems

0 references

Overlapping Domain Decomposition Methods for Total Variation Denoising

0 references

Total Variation Minimization with Finite Elements: Convergence and Iterative Solution

0 references

Discrete total variation with finite elements and applications to imaging

0 references

0 references

0 references

Coordinate descent algorithms

0 references

Signal Recovery by Proximal Forward-Backward Splitting

0 references

On the Convergence of Primal-Dual Hybrid Gradient Algorithm

0 references

Convergence Analysis of Primal-Dual Algorithms for a Saddle-Point Problem: From Contraction Perspective

0 references

Monotone Operators and the Proximal Point Algorithm

0 references

On the ergodic convergence rates of a first-order primal-dual algorithm

0 references

Identifiers

zbMATH Open document ID

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

10.12941/JKSIAM.2020.24.161

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5149918

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5149918&oldid=39543961"