Fast regularizing sequential subspace optimization in Banach spaces
Fast regularizing sequential subspace optimization in Banach spaces
复制标题
DOI：
10.1088/0266-5611/25/1/015013
复制
发表时间：
2008
期刊：
影响因子：
2.1
通讯作者：
F. Sch;Thomas Schuster
中科院分区：
文献类型：
--
作者：
F. Sch;Thomas Schuster
研究了Banach空间中线性算子方程正则化解的快速计算问题。为此，我们对最近发展的序列子空间优化方法进行了改进，将其中采用的超平面上的Bregman投影替换为条带上的Bregman投影，条带的宽度与噪声水平的量级相同。
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.