Complexity analysis of the iteratively regularized Gauss–Newton method with inner CG-iteration
DOI10.1515/JIIP.2009.051zbMath1189.65117OpenAlexW2039022747MaRDI QIDQ5187990
Publication date: 10 March 2010
Published in: Journal of Inverse and Ill-posed Problems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1515/jiip.2009.051
Hilbert spacescomplexity analysisnonlinear inverse problemsGauss-Newton methodleast-squares problemnonlinear ill-posed operator equationsregularized Newton methodsconjugate gradient (CG) method
Nonlinear ill-posed problems (47J06) Numerical solutions to equations with nonlinear operators (65J15) Complexity and performance of numerical algorithms (65Y20) Numerical solutions of ill-posed problems in abstract spaces; regularization (65J20) Numerical solution to inverse problems in abstract spaces (65J22)
Related Items (1)
Cites Work
- A convergence analysis of the Landweber iteration for nonlinear ill-posed problems
- The discretized discrepancy principle under general source conditions
- Preconditioning Landweber iteration in Hilbert scales
- On the numerical solution of a three-dimensional inverse medium scattering problem
- A simplified generalized Gauss-Newton method for nonlinear ill-posed problems
- Tikhonov regularisation for non-linear ill-posed problems: optimal convergence rates and finite-dimensional approximation
- Logarithmic convergence rates of the iteratively regularized Gauss - Newton method for an inverse potential and an inverse scattering problem
- Geometry of linear ill-posed problems in variable Hilbert scales
- Convergence analysis of an inexact iteratively regularized Gauss-Newton method under general source conditions
This page was built for publication: Complexity analysis of the iteratively regularized Gauss–Newton method with inner CG-iteration
