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

非线性反问题的序贯模型校正

Sequential model correction for nonlinear inverse problems

Arttu Arjas, Mikko J. Sillanpää, Andreas Hauptmann

AI总结:

针对非线性反问题,提出用线性模型近似并迭代校正误差的序贯方法,将问题凸化,证明收敛性,并展示优于传统方法的数值结果。

摘要:

反问题在许多情况下通过优化技术求解。当底层模型为线性时,一阶梯度方法通常就足够了。对于非线性模型,由于非凸性,通常必须求助于计算成本更高的二阶方法。在这项工作中,我们旨在用线性模型近似非线性模型,并校正由此产生的近似误差。我们开发了一种序贯方法,该方法迭代地求解一个线性反问题,并通过在新解处评估近似误差来更新该误差。这种处理将问题凸化,使我们能够受益于成熟的凸优化方法。我们分别考虑了近似在迭代中固定和近似自适应的情况。在固定情况下,我们从理论上展示了在何种假设下序列收敛。在自适应情况下,特别考虑通过一阶泰勒展开进行近似的特殊情况,我们证明在特定假设下,序列收敛到原始非凸泛函的一个临界点。此外,我们证明对于二次目标函数,该序列对应于高斯-牛顿方法。最后,我们展示了优于传统模型校正方法的数值结果。我们还表明,固定近似可以在显著加速计算的同时提供具有竞争力的结果。

英文摘要:

Inverse problems are in many cases solved with optimization techniques. When the underlying model is linear, first-order gradient methods are usually sufficient. With nonlinear models, due to nonconvexity, one must often resort to second-order methods that are computationally more expensive. In this work we aim to approximate a nonlinear model with a linear one and correct the resulting approximation error. We develop a sequential method that iteratively solves a linear inverse problem and updates the approximation error by evaluating it at the new solution. This treatment convexifies the problem and allows us to benefit from established convex optimization methods. We separately consider cases where the approximation is fixed over iterations and where the approximation is adaptive. In the fixed case we show theoretically under what assumptions the sequence converges. In the adaptive case, particularly considering the special case of approximation by first-order Taylor expansion, we show that with certain assumptions the sequence converges to a critical point of the original nonconvex functional. Furthermore, we show that with quadratic objective functions the sequence corresponds to the Gauss-Newton method. Finally, we showcase numerical results superior to the conventional model correction method. We also show, that a fixed approximation can provide competitive results with considerable computational speed-up.

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

↑