Home Mathematics Acceleration of the generalized Landweber method in Banach spaces via sequential subspace optimization
Article
Licensed
Unlicensed Requires Authentication

Acceleration of the generalized Landweber method in Banach spaces via sequential subspace optimization

  • F. Schöpfer and T. Schuster
Published/Copyright: February 4, 2009
Journal of Inverse and Ill-posed Problems
From the journal Volume 17 Issue 1

Abstract

The Landweber method is a well-known iterative procedure to compute regularized solutions of linear operator equations in Hilbert spaces. Unfortunately it is also known to be very slow. Likewise its generalization to Banach spaces has good regularizing properties but slow convergence. This article intends to give a short survey about the use of sequential subspace optimization to accelerate this method while preserving its regularizing properties.

Received: 2008-07-25
Published Online: 2009-02-04
Published in Print: 2009-February

© de Gruyter 2009

Downloaded on 17.2.2026 from https://www.degruyterbrill.com/document/doi/10.1515/JIIP.2009.011/html
Scroll to top button