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

Markus Hegland, Qinian Jin*, Wei Wang

*Corresponding author for this work

    Research output: Contribution to journalArticlepeer-review

    16 Citations (Scopus)

    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.

    Original languageEnglish
    Pages (from-to)524-547
    Number of pages24
    JournalApplicable Analysis
    Volume94
    Issue number3
    DOIs
    Publication statusPublished - 4 Mar 2015

    Fingerprint

    Dive into the research topics of 'Accelerated Landweber iteration with convex penalty for linear inverse problems in Banach spaces'. Together they form a unique fingerprint.

    Cite this