arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1907.06409math.OC
收藏

稳定的Barzilai-Borwein方法

Stabilized Barzilai-Borwein method

Oleg Burdakov, Yu-Hong Dai, Na Huang

摘要:

Barzilai-Borwein(BB)方法是求解大规模无约束最优化问题的一种有效工具。它的搜索方向与最速下降(柯西)法相同,但步长规则不同。因此,它的收敛速度比柯西方法快得多。BB方法的一个特性是它可能生成太长的步骤,这会使迭代离解决方案太远。此外,它可能不会收敛,即使当目标函数是强凸的。本文介绍了一种稳定化技术。它包括限制每对连续迭代之间的距离,这通常允许减少BB迭代的次数。当BB法不收敛时,我们对该方法作了简单的修改,使其收敛。在适当的假设下,我们证明了它的整体收敛,尽管事实上,没有线搜索,只使用梯度值。由于稳定化步数被证明是有限的,稳定化的版本继承了快速的局部收敛的BB方法。广泛的数值实验结果表明,我们的稳定化技术往往允许BB方法在更少的迭代求解问题,甚至解决后者失败的问题。

英文摘要:

The Barzilai-Borwein (BB) method is a popular and efficient tool for solving large-scale unconstrained optimization problems. Its search direction is the same as for the steepest descent (Cauchy) method, but its stepsize rule is different. Owing to this, it converges much faster than the Cauchy method. A feature of the BB method is that it may generate too long steps, which throw the iterates too far away from the solution. Moreover, it may not converge, even when the objective function is strongly convex. In this paper, a stabilization technique is introduced. It consists in bounding the distance between each pair of successive iterates, which often allows for decreasing the number of BB iterations. When the BB method does not converge, our simple modification of this method makes it convergent. Under suitable assumptions, we prove its global convergence, despite the fact that no line search is involved, and only gradient values are used. Since the number of stabilization steps is proved to be finite, the stabilized version inherits the fast local convergence of the BB method. The presented results of extensive numerical experiments show that our stabilization technique often allows the BB method to solve problems in a fewer iterations, or even to solve problems where the latter fails.

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

↑