Landweber-Kaczmarz method in Banach spaces with inexact inner solvers
Author:
- 5 August 2016
- journal article
- Published by IOP Publishing in Inverse Problems
- Vol. 32 (10) , 104005
Abstract
In recent years the 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 the Landweber-Kaczmarz method in Banach spaces in which the minimization problem involved in each iteration step is solved inexactly. Based on the ε -subdifferential calculus we give a convergence analysis of our method. Furthermore, using Nesterov's strategy, we propose a possible accelerated version of the 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.Keywords
All Related Versions
This publication has 30 references indexed in Scilit:
- On the Convergence of the Iterates of the “Fast Iterative Shrinkage/Thresholding Algorithm”Journal of Optimization Theory and Applications, 2015
- AIR Tools — A MATLAB package of algebraic iterative reconstruction methodsJournal of Computational and Applied Mathematics, 2012
- On the Convergence of Primal–Dual Hybrid Gradient Algorithms for Total Variation Image RestorationJournal of Mathematical Imaging and Vision, 2012
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse ProblemsSIAM Journal on Imaging Sciences, 2009
- On Steepest-Descent-Kaczmarz methods for regularizing systems of nonlinear ill-posed equationsApplied Mathematics and Computation, 2008
- Kaczmarz methods for regularizing nonlinear ill-posed equations II: ApplicationsInverse Problems and Imaging, 2007
- Kaczmarz methods for regularizing nonlinear ill-posed equations I: convergence analysisInverse Problems and Imaging, 2007
- 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
- The relaxation method of finding the common point of convex sets and its application to the solution of problems in convex programmingUSSR Computational Mathematics and Mathematical Physics, 1967