Regularization of inverse problems by two-point gradient methods with convex constraints

DOI10.1007/S00211-019-01068-0MaRDI QIDQ6311672arXivFDO

Authors Min Zhong, Wei Wang, Qinian Jin

Publication date 27 December 2018

Published in arXiv

Full work available at URL https://doi.org/10.1007/S00211-019-01068-0

Mathematics Subject Classification ID

Numerical solutions to equations with nonlinear operators (65J15) Numerical solutions of ill-posed problems in abstract spaces; regularization (65J20)

arXiv classification

math.NA

Abstract: In this paper, we propose and analyze a two-point gradient method for solving inverse problems in Banach spaces which is based on the Landweber iteration and an extrapolation strategy. The method allows to use non-smooth penalty terms, including the L^1 and the total variation-like penalty functionals, which are significant in reconstructing special features of solutions such as sparsity and piecewise constancy in practical applications. The design of the method involves the choices of the step sizes and the combination parameters which are carefully discussed. Numerical simulations are presented to illustrate the effectiveness of the proposed method.

This page was built for publication: Regularization of inverse problems by two-point gradient methods with convex constraints

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