Non-convexly constrained linear inverse problems


Blumensath, T. (2009) Non-convexly constrained linear inverse problems. (Submitted).

Download

[img] PDF - Pre print
Download (116Kb)

Description/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

Item Type: Article
Related URLs:
Subjects: Q Science > Q Science (General)
Divisions: University Structure - Pre August 2011 > School of Mathematics
Faculty of Engineering and the Environment > Institute of Sound and Vibration Research > Signal Processing & Control Research Group
ePrint ID: 142493
Date Deposited: 31 Mar 2010 16:03
Last Modified: 27 Mar 2014 19:04
URI: http://eprints.soton.ac.uk/id/eprint/142493

Actions (login required)

View Item View Item