An accelerated sequential subspace optimization method based on homotopy perturbation iteration for nonlinear ill-posed problems
- 19 November 2019
- journal article
- research article
- Published by IOP Publishing in Inverse Problems
- Vol. 35 (12) , 125005
Abstract
Homotopy perturbation iteration is an effective and fast method for solving nonlinear ill-posed problems. It only needs approximately half the computation time of Landweber iteration to reach the similar recovery precision. In this paper, a Nesterov-type accelerated sequential subspace optimization method based on homotopy perturbation iteration is proposed for solving nonlinear inverse problems. The convergence analysis is provided under the general assumptions for iterative regularization methods. The numerical experiments on inverse potential problem indicate that the proposed method dramatically reduces the total number of iterations and time consumption to obtain satisfying approximations, especially for the problems with costly solution of forward calculation.Keywords
Funding Information
- National Natural Science Foundation of China (11901373)
- National Natural Science Foundation of China (11871180)
This publication has 23 references indexed in Scilit:
- Convergence analysis of the homotopy perturbation method for solving nonlinear ill-posed operator equationsComputers & Mathematics with Applications, 2011
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse ProblemsSIAM Journal on Imaging Sciences, 2009
- Fast regularizing sequential subspace optimization in Banach spacesInverse Problems, 2008
- Metric and Bregman projections onto affine subspaces and their computation via sequential subspace optimization methodsJournal of Inverse and Ill-posed Problems, 2008
- On Landweber iteration for nonlinear ill-posed problems in Hilbert scalesNumerische Mathematik, 2000
- A modified landweber method for inverse problemsNumerical Functional Analysis and Optimization, 1999
- Iterative methods for the reconstruction of an inverse potential problemInverse Problems, 1996
- A convergence analysis of a method of steepest descent and a two–step algorothm for nonlinear ill–posed problemsNumerical Functional Analysis and Optimization, 1996
- A convergence analysis of the Landweber iteration for nonlinear ill-posed problemsNumerische Mathematik, 1995
- Accelerated Landweber iterations for the solution of ill-posed equationsNumerische Mathematik, 1991