Iteratively solving linear inverse problems under general convex constraints
Ingrid Daubechies - Princeton University, PACM, Washington Road, Princeton, NJ 08544-1000, United States (email)
Abstract: 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.
Keywords: Linear inverse problems, Landweber iteration, Besov- and BV restoration, Generalized shrinkage.
Received: August 2006; Revised: September 2006; Available Online: January 2007.
2015 Impact Factor.951