Non-convexly constrained linear inverse problems
Numerical Analysis
2009-11-30 v1
Abstract
This paper considers the inversion of ill-posed linear operators. To regularise the problem the solution is enforced to lie in a non-convex subset. Theoretical properties for the stable inversion are derived and an iterative algorithm akin to the projected Landweber algorithm is studied. This work extends recent progress made on the efficient inversion of finite dimensional linear systems under a sparsity constraint to the Hilbert space setting and to more general non-convex constraints.
Cite
@article{arxiv.0911.5098,
title = {Non-convexly constrained linear inverse problems},
author = {Thomas Blumensath},
journal= {arXiv preprint arXiv:0911.5098},
year = {2009}
}