The University of Southampton
University of Southampton Institutional Repository

Non-convexly constrained linear inverse problems

Blumensath, T. (2009) Non-convexly constrained linear inverse problems Author's Original

Record type: Article


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

PDF B_Inverse.pdf - Author's Original
Download (119kB)

More information

Submitted date: November 2009
Organisations: Signal Processing & Control Grp


Local EPrints ID: 142493
PURE UUID: 30af02d2-b967-4e53-b0b2-64f911699ae7

Catalogue record

Date deposited: 31 Mar 2010 16:03
Last modified: 18 Jul 2017 23:11

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

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton:

ePrints Soton supports OAI 2.0 with a base URL of

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.