arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1902.04794math.NAcs.NA
收藏

线性不适定问题的块坐标下降法分析

Analysis of the Block Coordinate Descent Method for Linear Ill-Posed Problems

Simon Rabanser, Lukas Neumann, Markus Haltmeier

摘要:

块坐标下降(BCD)方法通过沿交替的坐标子群执行梯度步骤来解决最优化问题。这与完全梯度下降相反,其中梯度步骤同时更新所有坐标。BCD已经被证明在许多实际的大规模应用中加速了梯度法。尽管它的成功没有收敛性分析的反问题是已知的。本文研究了求解线性反问题的BCD方法。作为主要的理论结果,我们证明了对于具有特殊张量积形式的算子,BCD方法结合适当的停止准则得到收敛的正则化方法。为了说明理论,我们进行了数值实验比较BCD和全梯度下降法的积分方程系统。我们还提出了一个非线性反问题,我们的理论,即一步反演多光谱X射线层析成像的数值测试。

英文摘要:

Block coordinate descent (BCD) methods approach optimization problems by performing gradient steps along alternating subgroups of coordinates. This is in contrast to full gradient descent, where a gradient step updates all coordinates simultaneously. BCD has been demonstrated to accelerate the gradient method in many practical large-scale applications. Despite its success no convergence analysis for inverse problems is known so far. In this paper, we investigate the BCD method for solving linear inverse problems. As main theoretical result, we show that for operators having a particular tensor product form, the BCD method combined with an appropriate stopping criterion yields a convergent regularization method. To illustrate the theory, we perform numerical experiments comparing the BCD and the full gradient descent method for a system of integral equations. We also present numerical tests for a non-linear inverse problem not covered by our theory, namely one-step inversion in multi-spectral X-ray tomography.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑