A fast splitting method for efficient split Bregman iterations

DOI10.1016/j.amc.2019.03.065zbMath1428.90205arXiv1809.11135OpenAlexW2962925567MaRDI QIDQ2009581

Damiana Lazzaro, Elena Loli Piccolomini, Fabiana Zama

Publication date: 29 November 2019

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1809.11135

zbMATH Keywords

weighted total variationsplit BregmanFISTAaccelerated forward backward

Mathematics Subject Classification ID

Convex programming (90C25) Applications of mathematical programming (90C90) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)

Related Items

2DNMR data inversion using locally adapted multi-penalty regularization

Uses Software

• RecPF

Cites Work

• Unnamed Item
• Nonlinear total variation based noise removal algorithms
• On the convergence of the iterates of the ``fast iterative shrinkage/thresholding algorithm
• A first-order primal-dual algorithm for convex problems with applications to imaging
• A New Alternating Minimization Algorithm for Total Variation Image Reconstruction
• The Split Bregman Method for L1-Regularized Problems
• Bregmanized Nonlocal Regularization for Deconvolution and Sparse Reconstruction
• Augmented Lagrangian Method, Dual Methods, and Split Bregman Iteration for ROF, Vectorial TV, and High Order Models
• A Note on P-Regular Splitting of Hermitian Matrix