On the iteratively regularized Gauss-Newton method for solving nonlinear ill-posed problems
DOI10.1090/S0025-5718-00-01199-6zbMath0962.65047OpenAlexW2058966142MaRDI QIDQ4501042
Publication date: 3 September 2000
Published in: Mathematics of Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1090/s0025-5718-00-01199-6
Iterative procedures involving nonlinear operators (47J25) Other nonlinear integral equations (45G10) Nonlinear ill-posed problems (47J06) Numerical solutions to equations with nonlinear operators (65J15) Numerical methods for ill-posed problems for integral equations (65R30) Numerical solutions of ill-posed problems in abstract spaces; regularization (65J20)
Related Items (29)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A posteriori parameter choice for general regularization methods for solving linear ill-posed problems
- Estimation techniques for distributed parameter systems
- The problem of the convergence of the iteratively regularized Gauss- Newton method
- A convergence analysis of the Landweber iteration for nonlinear ill-posed problems
- Ill-posed problems with a priori information
- Regularization methods for the stable solution of inverse problems
- Well posedness and convergence of some regularisation methods for non-linear ill posed problems
- Convergence rates for Tikhonov regularisation of non-linear ill-posed problems
- An A Posteriori Parameter Choice for Ordinary and Iterated Tikhonov Regularization of Ill-Posed Problems Leading to Optimal Convergence Rates
- Optimal a Posteriori Parameter Choice for Tikhonov Regularization for Solving Nonlinear Ill-Posed Problems
- On Converse and Saturation Results for Tikhonov Regularization of Linear Ill-Posed Problems
- On convergence rates for the iteratively regularized Gauss-newton method
- Some Newton-type methods for the regularization of nonlinear ill-posed problems
- On pseudo—optimal parameter choices and stopping rules for regularization methods in banach spaces∗
- A convergence analysis of a method of steepest descent and a two–step algorothm for nonlinear ill–posed problems
This page was built for publication: On the iteratively regularized Gauss-Newton method for solving nonlinear ill-posed problems