Optimal convergence rates for inexact Newton regularization with CG as inner iteration

DOI10.1515/jiip-2019-0092OpenAlexW3000352751WikidataQ126334827 ScholiaQ126334827MaRDI QIDQ2301662

Andreas Neubauer

Publication date: 25 February 2020

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-2019-0092

zbMATH Keywords

discrepancy principleconjugate gradient

Mathematics Subject Classification ID

Nonlinear ill-posed problems (47J06) Numerical solutions of ill-posed problems in abstract spaces; regularization (65J20) Linear operators and ill-posed problems, regularization (47A52)

Related Items (3)

On iteratively regularized predictor–corrector algorithm for parameter identification ^* ⋮ On stable parameter estimation and short-term forecasting with quantified uncertainty with application to COVID-19 transmission ⋮ Ill-posed problems and the conjugate gradient method: optimal convergence rates in the presence of discretization and modelling errors

Cites Work

• Unnamed Item
• Unnamed Item
• Iterative regularization methods for nonlinear ill-posed problems
• A posteriori parameter choice strategies for some Newton type methods for the regularization of nonlinear ill-posed problems
• A convergence analysis of the Landweber iteration for nonlinear ill-posed problems
• Regularizing properties of a truncated newton-cg algorithm for nonlinear inverse problems
• A New Gradient Method for Ill-Posed Problems
• Inexact Newton Regularization Using Conjugate Gradients as Inner Iteration

This page was built for publication: Optimal convergence rates for inexact Newton regularization with CG as inner iteration