English
Related papers

Related papers: Injectivity and weak*-to-weak continuity suffice f…

200 papers

Our focus is on the stable approximate solution of linear operator equations based on noisy data by using $\ell^1$-regularization as a sparsity-enforcing version of Tikhonov regularization. We summarize recent results on situations where…

Functional Analysis · Mathematics 2017-11-27 Daniel Gerth , Bernd Hofmann

In $\ell^1$-regularization, which is an important tool in signal and image processing, one usually is concerned with signals and images having a sparse representation in some suitable basis, e.g. in a wavelet basis. Many results on…

Optimization and Control · Mathematics 2018-09-28 Jens Flemming , Bernd Hofmann , Ivan Veselic

Variational sparsity regularization based on $\ell^1$-norms and other nonlinear functionals has gained enormous attention recently, both with respect to its applications and its mathematical analysis. A focus in regularization theory has…

Numerical Analysis · Mathematics 2015-06-11 Martin Burger , Jens Flemming , Bernd Hofmann

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…

Functional Analysis · Mathematics 2009-12-06 Markus Grasmair , Markus Haltmeier , Otmar Scherzer

Sparsity promoting regularization is an important technique for signal reconstruction and several other ill-posed problems. Theoretical investigation typically bases on the assumption that the unknown solution has a sparse representation…

Numerical Analysis · Mathematics 2013-11-11 Jens Flemming , Markus Hegland

This paper addresses the regularization by sparsity constraints by means of weighted $\ell^p$ penalties for $0\leq p\leq 2$. For $1\leq p\leq 2$ special attention is payed to convergence rates in norm and to source conditions. As main…

Functional Analysis · Mathematics 2011-03-16 Dirk A. Lorenz

In this paper, we consider the $\alpha\| \cdot\|_{\ell_1}-\beta\| \cdot\|_{\ell_2}$ sparsity regularization with parameter $\alpha\geq\beta\geq0$ for nonlinear ill-posed inverse problems. We investigate the well-posedness of the…

Numerical Analysis · Mathematics 2020-07-23 Liang Ding , Weimin Han

Based on the powerful tool of variational inequalities, in recent papers convergence rates results on $\ell^1$-regularization for ill-posed inverse problems have been formulated in infinite dimensional spaces under the condition that the…

Functional Analysis · Mathematics 2015-05-18 Jens Flemming , Bernd Hofmann , Ivan Veselic

The convergence rates results in $\ell^1$-regularization when the sparsity assumption is narrowly missed, presented by Burger et al. (2013 Inverse Problems 29 025013), are based on a crucial condition which requires that all basis elements…

Numerical Analysis · Mathematics 2015-08-05 Stephan W. Anzengruber , Bernd Hofmann , Ronny Ramlau

In this study, we investigate the $\left\|\cdot\right\|_{\ell_{1}}^{2}-\eta\left\|\cdot\right\|_{\ell_{2}}^{2}$ sparsity regularization with $0< \eta\leq 1$, in the context of nonlinear ill-posed inverse problems. We focus on the…

Numerical Analysis · Mathematics 2025-08-25 Long Li , Liang Ding

This work deals with a regularization method enforcing solution sparsity of linear ill-posed problems by appropriate discretization in the image space. Namely, we formulate the so called least error method in an $\ell^1$ setting and perform…

Numerical Analysis · Mathematics 2016-08-03 Kristian Bredies , Barbara Kaltenbacher , Elena Resmerita

The $\ell_{1\text{-}2}$ regularization method has a strong sparsity promoting capability in approaching sparse solutions of linear inverse problems and gained successful applications in various mathematics and applied science fields. This…

Optimization and Control · Mathematics 2026-03-04 Yaohua Hu , Hao Wang , Xiaoqi Yang

The Tikhonov regularization of linear ill-posed problems with an $\ell^1$ penalty is considered. We recall results for linear convergence rates and results on exact recovery of the support. Moreover, we derive conditions for exact support…

Functional Analysis · Mathematics 2015-05-18 Dirk A. Lorenz , Stefan Schiffler , Dennis Trede

In this paper, we prove optimal convergence rates results for regularisation methods for solving linear ill-posed operator equations in Hilbert spaces. The result generalises existing convergence rates results on optimality to general…

Functional Analysis · Mathematics 2015-11-11 Vinicius Albani , Peter Elbau , Maarten V. de Hoop , Otmar Scherzer

This investigation is motivated by PDE-constrained optimization problems arising in connection with electrocardiograms (ECGs) and electroencephalography (EEG). Standard sparsity regularization does not necessarily produce adequate results…

Numerical Analysis · Mathematics 2023-05-25 Ole Løseth Elvetun , Bjørn Fredrik Nielsen

This paper presents a regularization technique incorporating a non-convex and non-smooth term, $\ell_{1}^{2}-\eta\ell_{2}^{2}$, with parameters $0<\eta\leq 1$ designed to address ill-posed linear problems that yield sparse solutions. We…

Optimization and Control · Mathematics 2025-06-16 Long Li , Liang Ding

This work revisits a recent finding by the first author concerning the local convergence of a regularized scalar conservation law. We significantly improve the original statement by establishing a global convergence result within the…

Analysis of PDEs · Mathematics 2024-04-18 Billel Guelmame , Haroune Houamed

This paper considers a large class of linear operator equations, including linear boundary value problems for partial differential equations, and treats them as linear recovery problems for objects from their data. Well-posedness of the…

Numerical Analysis · Mathematics 2014-03-17 Robert Schaback

We consider the ill-posed operator equation $Ax=y$ with an injective and bounded linear operator $A$ mapping between $\ell^2$ and a Hilbert space $Y$, possessing the unique solution \linebreak $x^\dag=\{x^\dag_k\}_{k=1}^\infty$. For the…

Functional Analysis · Mathematics 2017-01-04 De-Han Chen , Bernd Hofmann , Jun Zou

We consider the decomposition of a signal over an overcomplete set of vectors. Minimization of the $\ell^1$-norm of the coefficient vector can often retrieve the sparsest solution (so-called "$\ell^1/\ell^0$-equivalence"), a generally…

Computer Vision and Pattern Recognition · Computer Science 2019-01-10 Chelsea Weaver , Naoki Saito
‹ Prev 1 2 3 10 Next ›