A fast splitting method for efficient split Bregman iterations

DOI10.1016/J.AMC.2019.03.065MaRDI QIDQ2009581zbMATH OpenOpenAlexFDO

Authors D. Lazzaro, E. Loli Piccolomini, F. 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

accelerated forward backwardFISTAsplit Bregmanweighted total variation

Mathematics Subject Classification ID

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

Abstract: In this paper we propose a new fast splitting algorithm to solve the Weighted Split Bregman minimization problem in the backward step of an accelerated Forward-Backward algorithm. Beside proving the convergence of the method, numerical tests, carried out on different imaging applications, prove the accuracy and computational efficiency of the proposed algorithm.

Recommendations

• A dual split Bregman method for fast \(\ell ^{1}\) minimization
• The Split Bregman Method for L1-Regularized Problems
• Accelerated Bregman operator splitting with backtracking
• Fast multiple-splitting algorithms for convex optimization
• scientific article; zbMATH DE number 996056
• Krylov subspace split Bregman methods
• Fast self-adaptive regularization iterative algorithm for solving split feasibility problem
• Fast computation of iterative operator-splitting methods
• Application of a new accelerating Bregman iterative algorithm in the sparse least squares problems

Cites work

• A first-order primal-dual algorithm for convex problems with applications to imaging
• A New Alternating Minimization Algorithm for Total Variation Image Reconstruction
• A Note on P-Regular Splitting of Hermitian Matrix
• Augmented Lagrangian method, dual methods, and split Bregman iteration for ROF, vectorial TV, and high order models
• Bregmanized nonlocal regularization for deconvolution and sparse reconstruction
• scientific article; zbMATH DE number 4067100 (Why is no real title available?)
• Nonlinear total variation based noise removal algorithms
• On the convergence of the iterates of the ``fast iterative shrinkage/thresholding algorithm
• The Split Bregman Method for L1-Regularized Problems

Cited in

(12)

• Fast weighted TV denoising via an edge driven metric
• 2DNMR data inversion using locally adapted multi-penalty regularization
• Using the split Bregman algorithm to solve the self-repelling snakes model
• Accelerating convergence of a class of splitting algorithms with iterative foldings
• Accelerated Bregman operator splitting with backtracking
• An \(\mathcal O(1/{k})\) convergence rate for the variable stepsize Bregman operator splitting algorithm
• Fast operator-splitting algorithms for variational imaging models: some recent developments
• Split Bregman algorithms for multiple measurement vector problem
• Split Bregman methods and frame based image restoration
• A dual split Bregman method for fast \(\ell ^{1}\) minimization
• A novel weighted fractional order variable exponent total variation model and its algorithm
• Metric selection in fast dual forward-backward splitting

Describes a project that uses

Uses Software

• RecPF

This page was built for publication: A fast splitting method for efficient split Bregman iterations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2009581)