A convergence analysis of the iteratively regularized Gauss–Newton method under the Lipschitz condition
Author:
- 22 May 2008
- journal article
- Published by IOP Publishing in Inverse Problems
- Vol. 24 (4)
Abstract
In this paper we consider the iteratively regularized Gauss-Newton method for solving nonlinear ill-posed inverse problems. Under merely Lipschitz condition, we prove that this method together with an a posteriori stopping rule defines an order optimal regularization method if the solution is regular in some suitable sense.Keywords
All Related Versions
This publication has 9 references indexed in Scilit:
- Tikhonov regularization anda posteriorirules for solving nonlinear ill posed problemsInverse Problems, 2002
- On convergence rates of inexact Newton regularizationsNumerische Mathematik, 2001
- On the iteratively regularized Gauss-Newton method for solving nonlinear ill-posed problemsMathematics of Computation, 2000
- On an a posteriori parameter choice strategy for Tikhonov regularization of nonlinear ill-posed problemsNumerische Mathematik, 1999
- On the regularization of nonlinear ill-posed problems via inexact Newton iterationsInverse Problems, 1999
- A posteriori parameter choice strategies for some Newton type methods for the regularization of nonlinearill-posed problemsNumerische Mathematik, 1998
- Some Newton-type methods for the regularization of nonlinear ill-posed problemsInverse Problems, 1997
- On convergence rates for the iteratively regularized Gauss-newton methodIMA Journal of Numerical Analysis, 1997
- Optimal a Posteriori Parameter Choice for Tikhonov Regularization for Solving Nonlinear Ill-Posed ProblemsSIAM Journal on Numerical Analysis, 1993