Accelerated landweber iteration with convex penalty for linear inverse problems in Banach spaces

Abstract

In recent years, Landweber iteration has been extended to solve linear inverse problems in Banach spaces by incorporating non-smooth convex penalty functionals to capture features of solutions. This method is known to be slowly convergent. However, because it is simple to implement, it still receives a lot of attention. By making use of the subspace optimization technique, we propose an accelerated version of Landweber iteration with non-smooth convex penalty which significantly speeds up the method. Numerical simulations are given to test the efficiency.