Landweber iteration of Kaczmarz type with general non-smooth convex penalty functionals
- 25 July 2013
- journal article
- Published by IOP Publishing in Inverse Problems
- Vol. 29 (8) , 085011
Abstract
The determination of solutions of many inverse problems usually requires a set of measurements which leads to solving systems of ill-posed equations. In this paper, we propose the Landweber iteration of Kaczmarz type with general uniformly convex penalty functional. The method is formulated by using tools from convex analysis. The penalty term is allowed to be non-smooth to include the L1 and total variation-like penalty functionals, which are significant in reconstructing special features of solutions such as sparsity and piecewise constancy in practical applications. Under reasonable conditions, we establish the convergence of the method. Finally, we present numerical simulations on tomography problems and parameter identification in partial differential equations to indicate the performance.Keywords
All Related Versions
This publication has 16 references indexed in Scilit:
- Fast Gradient-Based Algorithms for Constrained Total Variation Image Denoising and Deblurring ProblemsIEEE Transactions on Image Processing, 2009
- Mathematics of thermoacoustic tomographyEuropean Journal of Applied Mathematics, 2008
- Temporal back-projection algorithms for photoacoustic tomography with integrating line detectorsInverse Problems, 2007
- 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
- Convergence Analysis Of A Landweber—Kaczmarz Method For Solving Nonlinear Ill-Posed Problems2002
- Regularization of Inverse Problems1996
- A convergence analysis of the Landweber iteration for nonlinear ill-posed problemsNumerische Mathematik, 1995
- Minimal Surfaces and Functions of Bounded Variation1984
- 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