zbMATH — the first resource for mathematics

Examples
Geometry Search for the term Geometry in any field. Queries are case-independent.
Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact.
"Topological group" Phrases (multi-words) should be set in "straight quotation marks".
au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted.
Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff.
"Quasi* map*" py: 1989 The resulting documents have publication year 1989.
so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14.
"Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic.
dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles.
py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses).
la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

Operators
a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
Fields
any anywhere an internal document identifier
au author, editor ai internal author identifier
ti title la language
so source ab review, abstract
py publication year rv reviewer
cc MSC code ut uncontrolled term
dt document type (j: journal article; b: book; a: book article)
An iterative thresholding algorithm for linear inverse problems with a sparsity constraint. (English) Zbl 1077.65055

The linear inverse problem corresponding to an equation Kf=h with a bounded linear operator K:HL 2 (Ω) on a Hilbert space H consists in finding an estimate of f from not exactly given h. One of the best known methods of solving such (possibly ill-posed) problems is the Tikhonov regularization method where a regularization functional has to be minimized which is a sum of discrepancy and additional quadratic constraints multiplied by the regularization parameter.

The authors present a new method which is a generalization of the Tikhonov method. Namely, in place of classical quadratic constraints, a weighted l p -norm (1p2) of expansion coefficients of f with respect to a particular orthogonal basis in H is taken as a penalization term added to the discrepancy in the regularization functional. The proposed minimization procedure promotes sparsity of the expansion of f with respect to the basis under consideration. Wavelet bases as well as other orthogonal bases are taken into account.

To compute the corresponding regularized solution, the authors propose an iterative algorithm for solving a system of nonlinear equations related to the minimizing problem for the regularization functional. The detailed and full mathematical analysis of the proposed method is given. The strong convergence of successive iterates to the minimizer of the regularization functional is proved and stability of regularized solution is shown. The presented general regularization theorem establishes the convergence to the exact solution as the noise level tends to zero. Under some additional a priori assumptions error estimates are derived. Moreover, possible generalizations as well as the numerical complexity of the algorithm are discussed. In the Appendix a brief review of basic definitions of wavelets and their connection with Besov spaces is given.


MSC:
65J10Equations with linear operators (numerical methods)
65J22Inverse problems (numerical methods in abstract spaces)
65J20Improperly posed problems; regularization (numerical methods in abstract spaces)
47A52Ill-posed problems, regularization
42C40Wavelets and other special systems
65T60Wavelets (numerical methods)