Accelerated iterative regularization via dual diagonal descent

From MaRDI portal
Publication:5853571




Abstract: We propose and analyze an accelerated iterative dual diagonal descent algorithm for the solution of linear inverse problems with general regularization and data-fit functions. In particular, we develop an inertial approach of which we analyze both convergence and stability. Using tools from inexact proximal calculus, we prove early stopping results with optimal convergence rates for additive data-fit terms as well as more general cases, such as the Kullback-Leibler divergence, for which different type of proximal point approximations hold.



Cites work



Describes a project that uses

Uses Software





This page was built for publication: Accelerated iterative regularization via dual diagonal descent

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