A family of preconditioned iteratively regularized methods for nonlinear minimization

DOI10.1515/JIIP.2009.027zbMath1183.47007MaRDI QIDQ5191065

Alexandra B. Smirnova, Rosemary A. Renaut

Publication date: 28 July 2009

Published in: Journal of Inverse and Ill-posed Problems (Search for Journal in Brave)

zbMATH Keywords

ill-posed problemstopping ruleregularisationGauss-Newton method

Mathematics Subject Classification ID

Numerical solutions to equations with nonlinear operators (65J15) Numerical solutions of ill-posed problems in abstract spaces; regularization (65J20) Numerical methods for inverse problems for boundary value problems involving PDEs (65N21) Linear operators and ill-posed problems, regularization (47A52)

Cites Work

• A Lepskij-type stopping rule for regularized Newton methods
• A convergence analysis of iterative methods for the solution of nonlinear ill-posed problems under affinely invariant conditions
• Regularization of nonlinear illposed problems with closed operators
• Some Newton-type methods for the regularization of nonlinear ill-posed problems
• Logarithmic convergence rates of the iteratively regularized Gauss - Newton method for an inverse potential and an inverse scattering problem
• ON APPLICATION OF GENERALIZED DISCREPANCY PRINCIPLE TO ITERATIVE METHODS FOR NONLINEAR ILL-POSED PROBLEMS
• On a Problem of Adaptive Estimation in Gaussian White Noise
• Pointwise Error Estimates for Finite Element Solutions of the Stokes Problem
• Convergence of projected iterative regularization methods for nonlinear problems with smooth solutions
• Convergence and application of a modified iteratively regularized Gauss–Newton algorithm

This page was built for publication: A family of preconditioned iteratively regularized methods for nonlinear minimization