2001
DOI: 10.1007/pl00005448
|View full text |Cite
|
Sign up to set email alerts
|

On convergence rates of inexact Newton regularizations

Abstract: Summary. REGINN is an algorithm of inexact Newton type for the regularization of nonlinear ill-posed problems [Inverse Problems 15 (1999), pp. 309-327]. In the present article convergence is shown under weak smoothness assumptions (source conditions). Moreover, convergence rates are established. Some computational illustrations support the theoretical results. Classification (1991): 65J15, 65J20 Mathematics Subject

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

2
63
0

Year Published

2005
2005
2016
2016

Publication Types

Select...
4
3
1

Relationship

1
7

Authors

Journals

citations
Cited by 67 publications
(65 citation statements)
references
References 15 publications
2
63
0
Order By: Relevance
“…In [11] we were able to verify (under reasonable assumptions) that REGINN with a linear regularization scheme {g r } r∈N is well defined and indeed terminates. Moreover, we proved the existence of a positive κ min < 1 such that the source condition…”
Section: Introduction Our Goal Is To Find a Stable Approximate Solutmentioning
confidence: 81%
See 2 more Smart Citations
“…In [11] we were able to verify (under reasonable assumptions) that REGINN with a linear regularization scheme {g r } r∈N is well defined and indeed terminates. Moreover, we proved the existence of a positive κ min < 1 such that the source condition…”
Section: Introduction Our Goal Is To Find a Stable Approximate Solutmentioning
confidence: 81%
“…Here, C Q is a positive constant. For a discussion of the nontrivial factorization (2.1) and for examples of meaningful operators satisfying (2.1), we refer to [6,10,11], [12,Kapitel 7.3], and the literature cited therein.…”
Section: General Assumptions and Termination Of The Repeat-loop Thromentioning
confidence: 99%
See 1 more Smart Citation
“…The regularising effect of such methods has been studied by Hanke [19] and Rieder [36,37]. When applying an iterative regularisation method to (3.14) the inexact Newton method for solving (3.6) can be written as follows.…”
Section: Inexact Newton Iterationsmentioning
confidence: 99%
“…Other options for regularization are variants of inexact Newton methods [12,16,17]. A nice review is given in the recent book by Kaltenbacher et al [14].…”
Section: Introductionmentioning
confidence: 99%