Sparse Regularization with $l^q$ Penalty Term
Functional Analysis
2009-12-06 v3
Abstract
We consider the stable approximation of sparse solutions to non-linear operator equations by means of Tikhonov regularization with a subquadratic penalty term. Imposing certain assumptions, which for a linear operator are equivalent to the standard range condition, we derive the usual convergence rate of the regularized solutions in dependence of the noise level . Particular emphasis lies on the case, where the true solution is known to have a sparse representation in a given basis. In this case, if the differential of the operator satisfies a certain injectivity condition, we can show that the actual convergence rate improves up to .
Cite
@article{arxiv.0806.3222,
title = {Sparse Regularization with $l^q$ Penalty Term},
author = {Markus Grasmair and Markus Haltmeier and Otmar Scherzer},
journal= {arXiv preprint arXiv:0806.3222},
year = {2009}
}
Comments
15 pages