On the discrepancy principle for some Newton type methods for solving nonlinear inverse problems
- 26 November 2008
- journal article
- research article
- Published by Springer Nature in Numerische Mathematik
- Vol. 111 (4) , 509-558
Abstract
No abstract availableKeywords
All Related Versions
This publication has 18 references indexed in Scilit:
- A convergence analysis of the iteratively regularized Gauss–Newton method under the Lipschitz conditionInverse Problems, 2008
- A Lepskij-type stopping rule for regularized Newton methodsInverse Problems, 2005
- 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
- A convergence analysis of iterative methods for the solution of nonlinear ill-posed problems under affinely invariant conditionsInverse Problems, 1998
- Logarithmic convergence rates of the iteratively regularized Gauss - Newton method for an inverse potential and an inverse scattering problemInverse Problems, 1997
- On convergence rates for the iteratively regularized Gauss-newton methodIMA Journal of Numerical Analysis, 1997
- A regularizing Levenberg - Marquardt scheme, with applications to inverse groundwater filtration problemsInverse Problems, 1997
- Regularizing properties of a truncated newton-cg algorithm for nonlinear inverse problemsNumerical Functional Analysis and Optimization, 1997
- A convergence analysis of the Landweber iteration for nonlinear ill-posed problemsNumerische Mathematik, 1995