We propose a new iterative regularization method for solving inverse problems in Hilbert spaces. The iterative process of the proposed method combines classical iterative regularization format and Data-Driven approach. Data-Driven technique is based on the idea of deep learning to estimate the interior of a black box through a training set, so as to solve problems better and faster in some cases. In order to capture the special feature of solutions, convex functions are utilized to be penalty terms. Algorithmically, the two-point gradient acceleration strategy based on homotopy perturbation method is applied to the iterative scheme, which makes the method have satisfactory acceleration effect. We provide convergence analysis of the method under standard assumptions for iterative regularization methods. Finally, several numerical experiments are presented to show the effectiveness and acceleration effect of our method.
In this work, we investigate a stochastic gradient descent (SGD) method for solving inverse problems that can be written as systems of linear or nonlinear ill-posed equations in Banach spaces. The method uses only a randomly selected equation at each iteration and employs the convex function as the penalty term, and thus it is scalable to the problem size and has the ability to detect special features of solutions such as nonnegativity and piecewise constancy. To suppress the oscillation in iterates and reduce the semi-convergence of such methods, by incorporating the spirit of discrepancy principle, an adaptive strategy for choosing the step size is suggested. Under certain conditions, we establish the regularization results of the method under an a priori stopping rule. Further, we study an a posteriori stopping rule for SGD-θ method and show the finite iterations termination property. Several numerical simulations on computed tomography and schlieren imaging are provided to demonstrate the effectiveness of the method.
In this paper, we focus on a class of inverse problems with Lipschitz continuous Fréchet derivatives both in Hilbert spaces and Banach spaces. The convergence and convergence rate of the inexact Newton–Landweber method (INLM) for such problems are presented under some assumptions. For the inverse problems in Hilbert spaces, we revisit the convergence result and the convergence rate of the INLM under Lipschitz condition and Hölder stability. Furthermore, the INLM for nonlinear inverse problems in Banach spaces is also considered. By using a Hölder stability corresponding to the Bregman distance, we derive the convergence property and convergence rate of the method.
In this work, we formulate a projected Bouligand–Landweber iteration for non-smooth ill-posed problems. The approach is a combination of Bouligand–Landweber iteration and the projection onto stripes the width of which is controlled by both the noise level and the structure of the operator. Since the forward mapping is not Fréchet differentiable, the convergence analysis will be based on the concept of asymptotic stability and a generalized tangential cone condition. Finally, numerical examples will be presented.
We propose and analyze an accelerated homotopy perturbation iteration based on Nesterov strategy for nonlinear inverse problems in Banach spaces. The method allows to use L1 -like and total variation-like penalty terms. Therefore, it can cope with the situation where the sought solution is sparse and piece-wise constant. Under some standard assumptions, we show the convergence and regularization properties of the method. Numerical experiments are presented to show the effectiveness as well as the acceleration effect of the proposed method.