Analysis of the iteratively regularized Gauss-Newton method under a heuristic rule
The iteratively regularized Gauss-Newton method is one of the most prominent regularization methods for solving nonlinear ill-posed inverse problems when the data is corrupted by noise. In order to produce a useful approximate solution, this iterative method should be terminated properly. The existing a priori and a posteriori stopping rules require accurate information on the noise level, which may not be available or reliable in practical applications. In this paper we propose a heuristic...[Show more]
|Collections||ANU Research Publications|
|01_Jin_Analysis_of_the_iteratively_2018.pdf||1.98 MB||Adobe PDF||Request a copy|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.