Advanced Search
Article Contents
Article Contents

Iteratively solving linear inverse problems under general convex constraints

Abstract Related Papers Cited by
  • We consider linear inverse problems where the solution is assumed to fulfill some general homogeneous convex constraint. We develop an algorithm that amounts to a projected Landweber iteration and that provides and iterative approach to the solution of this inverse problem. For relatively moderate assumptions on the constraint we can always prove weak convergence of the iterative scheme. In certain cases, i.e. for special families of convex constraints, weak convergence implies norm convergence. The presented approach covers a wide range of problems, e.g. Besov-- or BV--restoration for which we present also numerical experiments in the context of image processing.
    Mathematics Subject Classification: Primary: 35, 41, 49; Secondary: 65.


    \begin{equation} \\ \end{equation}
  • 加载中

Article Metrics

HTML views() PDF downloads(138) Cited by(0)

Access History

Other Articles By Authors



    DownLoad:  Full-Size Img  PowerPoint