Inverse Problems · 2009 · 119 citations · 18 references
ComputingComputational EngineeringComputational MechanicsComputational PhysicsOptimizationConvergence AnalysisIterative SolversNumerical AlgorithmsNumerical ConvergenceConvergenceIll-posed Problem RegularizationIll-posed ProblemsIll-posedness AnalysisNonlinear Convergence AnalysisParameter IdentificationRegularizationRegularization Techniques
In this paper, we study convergence of two different iterative regularization methods for nonlinear ill-posed problems in Banach spaces. One of them is a Landweber type iteration, the other one the iteratively regularized Gauss–Newton method with an a posteriori chosen regularization parameter in each step. We show that a discrepancy principle as a stopping rule renders these iteration schemes regularization methods, i.e., we prove their convergence as the noise level tends to zero. The theoretical findings are illustrated by two parameter identification problems for elliptic PDEs.
18