Heuristic discrepancy principle for variational regularization of inverse problems

4Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

Abstract

We consider the variational regularization for inverse problems in a general form. Based on the discrepancy principle, we propose a heuristic parameter choice rule for choosing the regularization parameter which does not require the information on the noise level and is therefore purely data driven. Under variational source conditions, we obtain a posteriori error estimates. According to the Bakushinskii veto, convergence in the worst case scenario cannot be expected in general. However, by imposing certain conditions on the noisy data, we establish a convergence result for the heuristic rule. Applications of the results are addressed and numerical simulations are reported.

Cite

CITATION STYLE

APA

Liu, H., Real, R., Lu, X., Jia, X., & Jin, Q. (2020). Heuristic discrepancy principle for variational regularization of inverse problems. Inverse Problems, 36(7). https://doi.org/10.1088/1361-6420/ab844a

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free