Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
169 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Subgradient-based Lavrentiev regularisation of monotone ill-posed problems (2005.08917v2)

Published 18 May 2020 in math.OC, cs.NA, and math.NA

Abstract: We introduce subgradient-based Lavrentiev regularisation of the form \begin{equation*} \mathcal{A}(u) + \alpha \partial \mathcal{R}(u) \ni f\delta \end{equation*} for linear and nonlinear ill-posed problems with monotone operators $\mathcal{A}$ and general regularisation functionals $\mathcal{R}$. In contrast to Tikhonov regularisation, this approach perturbs the equation itself and avoids the use of the adjoint of the derivative of $\mathcal{A}$. It is therefore especially suitable for time-causal problems that only depend on information in the past and allows for real-time computation of regularised solutions. We establish a general well-posedness theory in Banach spaces and prove convergence-rate results with variational source conditions. Furthermore, we demonstrate its application in total-variation denoising in linear Volterra integral operators of the first kind and parameter-identification problems in semilinear parabolic PDEs.

Citations (2)

Summary

We haven't generated a summary for this paper yet.