• DOI:10.3934/IPI.2007.1.29
Corpus ID: 701589

Iteratively solving linear inverse problems under general convex constraints

@article{Daubechies2007IterativelySL,
  title={Iteratively solving linear inverse problems under general convex constraints},
  author={I. Daubechies and G. Teschke and L. Vese},
  journal={Inverse Problems and Imaging},
  year={2007},
  volume={1},
  pages={29-46}
}

I. Daubechies, G. Teschke, L. Vese

Published 2007

Mathematics

Inverse Problems and Imaging

We consider linear inverse problems where the solution is assumed to fulfill some general homogeneous convex constraint. We develop an algo- rithm that amounts to a projected Landweber iteration and that provides and iterative approach to the solution of this inverse problem. For relatively mod- erate assumptions on the constraint we can always prove weak convergence of the iterative scheme. In certain cases, i.e. for special families of convex con- straints, weak convergence implies norm… CONTINUE READING

View via Publisher

doi.org

Save to Library

Create Alert

Cite

Launch Research Feed