A Fast Splitting Method for efficient Split Bregman Iterations
classification
🧮 math.NA
cs.NA
keywords
algorithmbregmanfastmethodsplitsplittingacceleratedaccuracy
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.