2018
DOI: 10.1007/s00211-018-0987-x
|View full text |Cite
|
Sign up to set email alerts
|

Higher order convergence rates for Bregman iterated variational regularization of inverse problems

Abstract: We study the convergence of variationally regularized solutions to linear ill-posed operator equations in Banach spaces as the noise in the right hand side tends to 0. The rate of this convergence is determined by abstract smoothness conditions on the solution called source conditions. For non-quadratic data fidelity or penalty terms such source conditions are often formulated in the form of variational inequalities. Such variational source conditions (VSCs) as well as other formulations of such conditions in … Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
2
0

Year Published

2019
2019
2021
2021

Publication Types

Select...
3
1
1

Relationship

1
4

Authors

Journals

citations
Cited by 5 publications
(2 citation statements)
references
References 36 publications
0
2
0
Order By: Relevance
“…Recently, the authors have developed a method for the verification of variational source conditions in Hilbert spaces under standard smoothness conditions. This method has been successfully applied to a number of interesting inverse problems, both linear and nonlinear [25,26,35,40].…”
mentioning
confidence: 99%
“…Recently, the authors have developed a method for the verification of variational source conditions in Hilbert spaces under standard smoothness conditions. This method has been successfully applied to a number of interesting inverse problems, both linear and nonlinear [25,26,35,40].…”
mentioning
confidence: 99%
“…The question arises whether faster rates up to O(δ 4/3 ) as seen in Theorem 2.5 are achievable with VSCs. For linear operators this question has been answered in [Gra13], see also [SH18] for even faster rates by using Bregman iteration as a regularization method. The idea is roughly the following: If we want to achieve faster rates than O(δ) then at least the condition that guarantees the rate of O(δ) should hold true and hence by Proposition 2.33 we should have f * = T * p for f * ∈ ∂R( f † ).…”
Section: Higher Order Ratesmentioning
confidence: 99%