Fast regularizing sequential subspace optimization in Banach spaces

We are concerned with fast computations of regularized solutions of linear operator equations in Banach spaces in case only noisy data are available. To this end we modify recently developed sequential subspace optimization methods in such a way that the therein employed Bregman projections onto hyp...

Full description

Saved in:
Bibliographic Details
Published inInverse problems Vol. 25; no. 1; pp. 015013 - 015013 (22)
Main Authors Schöpfer, F, Schuster, T
Format Journal Article
LanguageEnglish
Published Bristol IOP Publishing 01.01.2009
Institute of Physics
Subjects
Exact sciences and technology
Physics
Inverse problems
Operator equation
Optimization method
Banach space
Linear operator
Hyperplane
Optimization
Online AccessGet full text

Cover

More Information
Summary:We are concerned with fast computations of regularized solutions of linear operator equations in Banach spaces in case only noisy data are available. To this end we modify recently developed sequential subspace optimization methods in such a way that the therein employed Bregman projections onto hyperplanes are replaced by Bregman projections onto stripes whose width is in the order of the noise level.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0266-5611
1361-6420
DOI:10.1088/0266-5611/25/1/015013