Non-convexly constrained linear inverse problems
Non-convexly constrained linear inverse problems
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
Blumensath, T.
470d9055-0373-457e-bf80-4389f8ec4ead
Blumensath, T.
470d9055-0373-457e-bf80-4389f8ec4ead
Blumensath, T.
(2009)
Non-convexly constrained linear inverse problems.
Author's Original.
(Submitted)
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
Text
B_Inverse.pdf
- Author's Original
More information
Submitted date: November 2009
Organisations:
Signal Processing & Control Grp
Identifiers
Local EPrints ID: 142493
URI: http://eprints.soton.ac.uk/id/eprint/142493
PURE UUID: 30af02d2-b967-4e53-b0b2-64f911699ae7
Catalogue record
Date deposited: 31 Mar 2010 16:03
Last modified: 14 Mar 2024 02:55
Export record
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.
View more statistics
