趋近与循环在Walker型鞍点搜索算法中的表现
Convergence and Cycling in Walker-type Saddle Search Algorithms
AI总结:
本文研究了Walker型鞍点搜索算法的收敛性与循环现象,改进了鞍点吸引区域的估计,并构造了准周期解,表明无法获得全局收敛的dimer和GAD型算法。
摘要:
计算光滑目标函数局部极小值的算法拥有成熟的理论和稳健高效的实现。相比之下,鞍点搜索的理论和实践却十分薄弱。本文针对dimer和gentlest ascent (GAD)鞍点搜索算法的理想化版本,展示了当前鞍点搜索算法类中理论上可实现的局限性:(1) 提供了对鞍点吸引区域的改进估计;(2) 构造了准周期解,表明无法获得全局收敛的dimer和GAD型算法。
英文摘要:
Algorithms for computing local minima of smooth objective functions enjoy a mature theory as well as robust and efficient implementations. By comparison, the theory and practice of saddle search is destitute. In this paper we present results for idealized versions of the dimer and gentlest ascent (GAD) saddle search algorithms that show-case the limitations of what is theoretically achievable within the current class of saddle search algorithms: (1) we present an improved estimate on the region of attraction of saddles; and (2) we construct quasi-periodic solutions which indicate that it is impossible to obtain globally convergent variants of dimer and GAD type algorithms.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。