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 selection rule for this regularization method, which requires no information on the noise level. By imposing certain conditions on the noise, we derive a posteriori error estimates on the approximate solutions under various source conditions. Furthermore, we establish a convergence result without using any source condition. Numerical results are presented to illustrate the performance of our heuristic selection rule.
In this work, we propose a two-point Landweber-type method with general convex penalty terms for solving nonsmooth nonlinear inverse problems. The design of our method can cope with nonsmooth nonlinear inverse problems or the nonlinear inverse problems whose data are contaminated by various types of noise. The method consists of the two-point acceleration strategy and inner solvers. Inner solvers are used to solve the minimization problems with respect to the penalty terms in each steps. If the minimization problems can be solved explicitly, the inner solvers will be chosen to be the exact solvers. Otherwise, we will use inexact solvers as inner solvers. Convergence results are given without utilizing the Gâteaux differentiability of the forward operator or the reflexivity of the image space. Numerical simulations are given to test the performance of the proposed method.
We consider determining -minimizing solutions of linear ill-posed problems , where is a bounded linear operator from a Banach space to a Hilbert space and is a proper strongly convex penalty function. Assuming that multiple repeated independent identically distributed unbiased data of y are available, we consider a dual gradient method to reconstruct the -minimizing solution using the average of these data. By terminating the method by either an a priori stopping rule or a statistical variant of the discrepancy principle, we provide the convergence analysis and derive convergence rates when the sought solution satisfies certain variational source conditions. Various numerical results are reported to test the performance of the method.
We investigate the method of asymptotical regularization for the stable approximate solution of nonlinear ill-posed problems F(x) = y in Hilbert spaces. The method consists of two components, an outer Newton iteration and an inner scheme providing increments by solving a local coupling linearized evolution equations. In addition, a non-smooth uniformly convex functional has been embedded in the evolution equations which is allowed to be non-smooth, including L1-liked and total variation-like penalty terms. We establish convergence properties of the method, derive stability estimates, and perform the convergence rate under the Hölder continuity of the inverse mapping. Furthermore, based on Runge–Kutta (RK) discretization, different kinds of iteration schemes can be developed for numerical realization. In our numerical experiments, four types iterative scheme, including Landweber type, one-stage explicit, implicit Euler and two-stage RK are presented to illustrate the performance of the proposed method.