Landweber-Kaczmarz method in Banach spaces with inexact inner solvers

Abstract

In recent years Landweber(-Kaczmarz) method has been proposed for solving nonlinear ill-posed inverse problems in Banach spaces using general convex penalty functions. The implementation of this method involves solving a (nonsmooth) convex minimization problem at each iteration step and the existing theory requires its exact resolution which in general is impossible in practical applications. In this paper we propose a version of Landweber-Kaczmarz method in Banach spaces in which the minimization problem involved in each iteration step is solved inexactly. Based on the $\epsilon$-subdifferential calculus we give a convergence analysis of our method. Furthermore, using Nesterov's strategy, we propose a possible accelerated version of Landweber-Kaczmarz method. Numerical results on computed tomography and parameter identification in partial differential equations are provided to support our theoretical results and to demonstrate our accelerated method.

To appear in Inverse Problems

References in corpus (2)

• Regularization of systems of nonlinear ill-posed equations: I. Convergence Analysis
• Regularization of systems of nonlinear ill-posed equations: II. Applications

Cited by in corpus (7)

• Stochastic mirror descent method for linear ill-posed problems in Banach spaces
• Lamé Parameter Estimation from Static Displacement Field Measurements in the Framework of Nonlinear Inverse Problems
• A Bregman-Kaczmarz method for nonlinear systems of equations
• Displacement field estimation from OCT images utilizing speckle information with applications in quantitative elastography
• A novel two-point gradient method for Regularization of inverse problems in Banach spaces
• Randomized block coordinate descent method for linear ill-posed problems
• On the asymptotical regularization with convex constraints for inverse problems