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.
Lazzaro D., Loli Piccolomini E., Zama F. (2019). A fast splitting method for efficient Split Bregman iterations. APPLIED MATHEMATICS AND COMPUTATION, 357, 139-146 [10.1016/j.amc.2019.03.065].
A fast splitting method for efficient Split Bregman iterations
Lazzaro D.;Loli Piccolomini E.;Zama F.
2019
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.File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
main_amc_LPLZ1.pdf
accesso aperto
Tipo:
Postprint
Licenza:
Licenza per Accesso Aperto. Creative Commons Attribuzione - Non commerciale - Non opere derivate (CCBYNCND)
Dimensione
574.02 kB
Formato
Adobe PDF
|
574.02 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
