Subgradient-based Lavrentiev regularisation of monotone ill-posed problems

arXiv2005.08917MaRDI QIDQ6340952FDOQ6340952

Authors: Markus Grasmair, Fredrik Hildrum 

Publication date: 18 May 2020

Abstract: We introduce subgradient-based Lavrentiev regularisation of the form �egin{equation*} mathcal{A}(u) + alpha partial mathcal{R}(u) i f^delta end{equation*} for linear and nonlinear ill-posed problems with monotone operators $mathcalA$ and general regularisation functionals $mathcalR$. In contrast to Tikhonov regularisation, this approach perturbs the equation itself and avoids the use of the adjoint of the derivative of $mathcalA$. It is therefore especially suitable for time-causal problems that only depend on information in the past, governed for instance by Volterra integral operators of the first kind. We establish a general well-posedness theory in Banach spaces, prove convergence-rate results using variational source conditions, and include some illustrating examples.

Mathematics Subject Classification ID

Inverse problems for integral equations (45Q05) Monotone operators and generalizations (47H05) Nonlinear ill-posed problems (47J06) Numerical solutions of ill-posed problems in abstract spaces; regularization (65J20) Numerical methods for ill-posed problems for integral equations (65R30)

This page was built for publication: Subgradient-based Lavrentiev regularisation of monotone ill-posed problems

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