Department of Mathematics
 Search | Help | Login | pdf version | printable version

Math @ Duke



Publications [#335534] of Ingrid Daubechies

Papers Published

  1. Daubechies, I; Teschke, G; Vese, L, Iteratively solving linear inverse problems under general convex constraints, Inverse Problems and Imaging, vol. 1 no. 1 (January, 2007), pp. 29-46, American Institute of Mathematical Sciences (AIMS) [doi]
    (last updated on 2019/05/24)

    © 2007 AIMSciences. 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.
ph: 919.660.2800
fax: 919.660.2821

Mathematics Department
Duke University, Box 90320
Durham, NC 27708-0320