Accelerated homotopy perturbation iteration method for a non-smooth nonlinear ill-posed problem
Introduction
In this paper, we consider a nonlinear ill-posed problem where , a parameter-to-observation mappings between real Hilbert spaces X and Y, is compact and directionally but not Gâteaux differentiable. Throughout this paper, it is assumed that is the exact solution to be recovered, and the given data is the an approximation of exact data y satisfying where and is noise level. Since the problem to estimate x is usually ill-posed in the sense that the solution does not depend continuously on data, several regularization methods have been proposed for non-smooth problem (1) to obtain a stable solution, such as non-differentiable regularization methods in Banach space [18], [16], [8] and modified iterative regularization methods in Hilbert space [9], [10].
As a classic iterative regularization, Landweber iteration has the form of where is the step size and is the Fréchet derivative of F at . It is not applicable for the case that F is not Gâteaux differentiable. A potential technique is to replace by a suitable linear operator closing to in the proper sense, such as the modified Landweber method [15]. In derivative-free Landweber iteration method [9], [10], such operator , satisfying the continuity of the mapping , is constructed for parameter identification in certain elliptic PDEs.
In [3], a Bouligand-Landweber iteration (BL) method is proposed based on the classic Landweber iterative format (3), which uses Bouligand subdifferential in place of the non-existence for nonlinear problem (1). The BL method has the form of where is the step size, the is the linear operator taken from Bouligand subdifferential of F. The Bouligand subdifferential is defined as the set of limits of Fréchet derivatives in differentiable points [14, Def.2.12]. In [3], the continuity of the mapping is not assumed, so a new convergence analysis for BL method is presented by introducing the concept of asymptotic stability and relaxing assumptions for classical iterative regularization methods. As first-order scheme, the BL method needs proceed large number of iterations to meet the stopping rule. The Nesterov's acceleration is introduced into the BL method to construct a fast two-point gradient Bouligand Landweber method [12]. Bouligand-Levenberg-Marquardt method considered in [4], a Newton type iteration method, also uses a family of bounded linear operators taken from Bouligand subdifferential to replace the Fréchet derivative in the classical Levenberg-Marquardt iteration. In [5], a projected Bouligand-Landweber (PBL) method is given by where for some fixed M and is chosen by projective strategy. The key idea of PBL method is that the new iterate is updated by projecting into the stripe which is decided by search direction , the property of F and noise level. The projection technique efficiently accelerates convergence speed.
The methods by using multiple proper search directions to update the new iterate have been studied for linear and nonlinear inverse problems, which can efficiently reduce the total number of iterations as well as time consumption for obtaining satisfying approximations [17], [7], [23], [22], [20]. Inspired by this, we consider to construct a fast iterative method for solving non-smooth problem (1) by using multiply search directions.
Sequential subspace optimization (SESOP) method was proposed to update the new iterate through several search directions weighted by suitable step sizes [13]. These step sizes are chosen to project the current iterate into the intersection of several convex closed sets. The SESOP method has been introduced into the iterative regularization methods for inverse problems in Hilbert and Banach spaces [20], [17], [23], [22]. The step sizes chosen by projective method under several search directions make SESOP method have obvious advantage of reducing the numerical cost for obtaining good approximations.
In this paper, with the help of the idea of SESOP method, we consider the multiple search directions coming from J-order Homotopy perturbation (HP) iteration method. Homotopy perturbation iteration for solving nonlinear ill-posed problems was proposed in [1] with the form of where J is the order of the HP method, is the step size, is a proper parameter. The HP iterative method has more fast convergence speed in comparison with classic Landweber method.
Based on the above considerations and the non-smooth of operator F, we propose a modified homopoty perturbation iterative method based on the spirit of BL method, which utilizes a bounded linear operator to replace in (6), i.e., where is a finite index set. In (7), the terms can be regarded as the search directions, then the step sizes can be chosen by projective strategy based on SESOP method. This method is named as SE-BHP method. In SE-BHP method, we define J stripes related to the search direction , noise level and the structure of the operator F, then the step sizes are chosen to make new update be the projection of onto the intersection of these stripes. The PBL method in [5] can be regarded as a special case of our proposed Algorithm 3.4 with , i.e., the new iterate is updated by one search direction.
The rest of this paper is organized as follows. In section 2, some basic notations, main assumptions and necessary preliminary results are briefly summarized. In section 3, we introduce the proposed SE-BHP method and then analyze its convergence. Numerical examples are performed to validate the efficiency of proposed methods in section 4. Finally, some conclusions are given in section 5.
Section snippets
Preliminaries
In this section, we will present some necessary concepts and auxiliary results for the following analysis. Let us begin with some results about SESOP method which have been stated in [17], [23], [22].
Definition 2.1 Let X be a real Hilbert space, we define the hyperplane and the halfspace for and . Additionally, , and can be defined similarly. We define the stripe as for , and with .
The SE-BHP method and its convergence
In this section, we will show the convergence and regularity of the SE-BHP method for the problem (1) under some suitable assumptions which have been applied in [3], [12], [5].
Let be an arbitrary and fixed solution of (1) with exact data y. For some , we denote by the solution set of (1) contained in , i.e. where .
Without the smoothness of F in (1), we use a suitable bounded linear operator to replace the possibly
Numerical simulations
In this section, some numerical experiments are carried out to study the reconstruction performance of the proposed SE-BHP method.
Conclusions
A fast iterative method (SE-BHP) based on J order homotopy perturbation iteration and SESOP technique is proposed for non-smooth nonlinear problems, where the Bouligand subderivative of the forward mapping is utilized to replace the non-exist Fréchet derivative. The convergence and regularity of SE-BHP are studied by using a generalized tangential cone condition and the concept of asymptotic stability. The numerical experiments validate that the SE-BHP method with multiple search directions can
Acknowledgements
The work of Tong, S. is supported by the National Natural Science Foundation of China (No.11901373) and the Fundamental Research Funds for the Central Universities (No. GK202003007). The work of Wang, W. is supported by National Natural Science Foundation of China (No. 12071184), Zhejiang Provincial Natural Science Foundation of China (No. LY19A010009) and the Major R & D Plan of Science and Technology of Zhejiang (Project No. 2019C03099). The work of Han, B. is supported by National Natural
References (24)
Convergence criteria of iterative methods based on Landweber iteration for solving nonlinear problems
J. Math. Anal. Appl.
(1995)- et al.
Homotopy perturbation method for nonlinear ill-posed operator equations
Int. J. Nonlinear Sci. Numer. Simul.
(2009) - et al.
Optimal control of a non-smooth semilinear elliptic equation
Math. Control Relat. Fields
(2018) - et al.
Bouligand-Landweber iteration for a non-smooth ill-posed problem
Numer. Math.
(2019) - et al.
Bouligand-Levenberg-Marquardt iteration for a non-smooth ill-posed inverse problem
Electron. Trans. Numer. Anal.
(2019) - et al.
A projected Bouligand-Landweber iteration for non-smooth ill-posed problems
Inverse Probl.
(2021) - et al.
A convergence analysis of the Landweber iteration for nonlinear ill-posed problems
Numer. Math.
(1995) - et al.
Accelerated landweber iteration with convex penalty for linear inverse problems in Banach spaces
Appl. Anal.
(2015) - et al.
A convergence rates result for Tikhonov regularization in Banach spaces with non-smooth operators
Inverse Probl.
(2007) A derivative-free landweber iteration for parameter identification in certain elliptic PDEs
Inverse Probl.
(2003)
Convergence rate analysis of a derivative free Landweber iteration for parameter identification in certain elliptic pdes
Numer. Math.
The averaged Kaczmarz iteration for solving inverse problems
SIAM J. Imaging Sci.
Cited by (2)
A heuristic review on the homotopy perturbation method for non-conservative oscillators
2022, Journal of Low Frequency Noise Vibration and Active Control