A fast two-point gradient algorithm based on sequential subspace optimization method for nonlinear ill-posed problems

In this paper, we propose and analyze a fast two-point gradient algorithm for solving nonlinear ill-posed problems, which is based on the sequential subspace optimization method. A complete convergence analysis is provided under the classical assumptions for iterative regularization methods. The design of the two-point gradient method involves the choices of the combination parameters which is systematically discussed. Furthermore, detailed numerical simulations are presented for inverse potential problem, which exhibit that the proposed method leads to a strongly decrease of the iteration numbers and the overall computational time can be significantly reduced.

[1]  A. Bakushinsky,et al.  Iterative Methods for Approximate Solution of Inverse Problems , 2005 .

[2]  Bangti Jin,et al.  A Semismooth Newton Method for Nonlinear Parameter Identification Problems with Impulsive Noise , 2012, SIAM J. Imaging Sci..

[3]  Otmar Scherzer,et al.  Convergence rates of iterated Tikhonov regularized solutions of nonlinear III — posed problems , 1993 .

[4]  Barbara Kaltenbacher,et al.  Regularization Methods in Banach Spaces , 2012, Radon Series on Computational and Applied Mathematics.

[5]  Bo Han,et al.  Fast subspace optimization method for nonlinear inverse problems in Banach spaces with uniformly convex penalty terms , 2019, Inverse Problems.

[6]  Anne Wald,et al.  A fast subspace optimization method for nonlinear inverse problems in Banach spaces with an application in parameter identification , 2018, Inverse Problems.

[7]  Wei Wang,et al.  Landweber iteration of Kaczmarz type with general non-smooth convex penalty functionals , 2013, 1307.4311.

[8]  Y. Nesterov.  A method for solving the convex programming problem with convergence rate O(1/k^2) , 1983 .

[9]  Qinian Jin,et al.  Landweber-Kaczmarz method in Banach spaces with inexact inner solvers , 2016, 1603.07490.

[10]  P. Maass,et al.  An iterative regularization method for nonlinear problems based on Bregman projections , 2016 .

[11]  Jin Cheng,et al.  Regularization Methods for Ill-Posed Problems , 2015, Handbook of Mathematical Methods in Imaging.

[12]  Bo Han,et al.  An accelerated sequential subspace optimization method based on homotopy perturbation iteration for nonlinear ill-posed problems , 2019, Inverse Problems.

[13]  T. Schuster,et al.  Sequential subspace optimization for nonlinear inverse problems , 2016, 1602.06781.

[14]  Bangti Jin,et al.  Inverse Problems , 2014, Series on Applied Mathematics.

[15]  Qinian Jin,et al.  Regularization of inverse problems by two-point gradient methods with convex constraints , 2018, 1812.10645.

[16]  Frank Schopfer,et al.  A CG-type method in Banach spaces with an application to computerized tomography , 2016, 1602.04036.

[17]  Barbara Kaltenbacher,et al.  Iterative Regularization Methods for Nonlinear Ill-Posed Problems , 2008, Radon Series on Computational and Applied Mathematics.

[18]  Bo Han,et al.  A projective two-point gradient Kaczmarz iteration for nonlinear ill-posed problems , 2021, Inverse Problems.

[19]  Lea Fleischer,et al.  Regularization of Inverse Problems , 1996 .

[20]  Ronny Ramlau,et al.  Convergence analysis of a two-point gradient method for nonlinear ill-posed problems , 2017 .

[21]  M. Hanke,et al.  A convergence analysis of the Landweber iteration for nonlinear ill-posed problems , 1995 .

[22]  Scherzer Otmar,et al.  A convergence analysis of a method of steepest descent and a two–step algorothm for nonlinear ill–posed problems , 1996 .

[23]  Hedy Attouch,et al.  The Rate of Convergence of Nesterov's Accelerated Forward-Backward Method is Actually Faster Than 1/k2 , 2015, SIAM J. Optim..

[24]  Otmar Scherzer,et al.  Variational Methods in Imaging , 2008, Applied mathematical sciences.

[25]  Bo Han,et al.  A new Kaczmarz-type method and its acceleration for nonlinear ill-posed problems , 2019, Inverse Problems.

[26]  M. Hegland,et al.  Accelerated Landweber iteration with convex penalty for linear inverse problems in Banach spaces , 2015 .

[27]  W. Rundell,et al.  Iterative methods for the reconstruction of an inverse potential problem , 1996 .

[28]  Alfred K. Louis,et al.  Metric and Bregman projections onto affine subspaces and their computation via sequential subspace optimization methods , 2008 .

[29]  Anne Wald,et al.  Sequential subspace optimization for nonlinear inverse problems with an application in terahertz tomography , 2017 .

[30]  Ronny Ramlau,et al.  Nesterov’s accelerated gradient method for nonlinear ill-posed problems with a locally convex residual functional , 2018, Inverse Problems.

[31]  F. Schöpfer,et al.  Fast regularizing sequential subspace optimization in Banach spaces , 2008 .