The residual method for regularizing ill-posed problems (Q425458): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Changed an Item |
||
Property / arXiv ID | |||
Property / arXiv ID: 0905.1187 / rank | |||
Normal rank |
Revision as of 14:33, 18 April 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The residual method for regularizing ill-posed problems |
scientific article |
Statements
The residual method for regularizing ill-posed problems (English)
0 references
8 June 2012
0 references
In signal or image processing (particularly, in compressed sensing) the main considered tool is the residual method. A deeper mathematical frame within Banach or topological vectorial spaces is still missing in contrast to the equivalent (at some point) Tikhonov regularization. Drawing a parallel between these two methods, we can imagine the missing mathematical gap within the residual method. The paper aims to fill that lack ``as much as possible''. Specifically, the existence (well-posedness), stability and convergence (rates) are discussed. Three main examples are given. First, one deals with regularization on \(L_p\)-spaces and shows the equivalence between Tikhonov and residual methods. Secondly, one deals with regularization of probability measures. The last example regards the compressed sensing.
0 references
ill-posed problems
0 references
residual method
0 references
sparsity
0 references
stability
0 references
convergence
0 references
signal processing
0 references
Banach space
0 references
\(L_p\) space
0 references
image processing
0 references
compressed sensing
0 references
Tikhonov regularization
0 references