arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1104.0350math.OCmath.DS
收藏

二维约束Nelder-Mead算法的收敛性

Convergence of the restricted Nelder-Mead algorithm in two dimensions

Jeffrey C. Lagarias, Bjorn Poonen, Margaret H. Wright

摘要:

Nelder-Mead算法是1965年发表的一种无约束优化的长期直接搜索法,它的目的是只使用函数值,而不使用任何导数信息来最小化n个实变量的标量值函数f。每个Nelder-Mead迭代都与一个由n+1个顶点及其函数值定义的非退化单纯形相关联;一个典型的迭代通过用一个新点替换最差的顶点来产生一个新的单纯形。尽管该方法的广泛使用,理论上的结果已经受到限制:对于严格凸的目标函数的一个变量与有界的水平集,该算法总是收敛到最小值;对于这样的功能的两个变量,单纯形的直径收敛到零,但由麦金农构造的例子表明,该算法可能会收敛到一个非最小化点。本文认为,限制Nelder-Mead算法,一个变种,不允许扩展步骤。在二维情形下,我们证明了对于任何非退化的起始单纯形和任何具有正定Hessian和有界水平集的二次连续可微函数,算法总是收敛到极小点.证明是基于处理的方法作为一个离散的动力系统,并依赖于几种技术,是非标准的无约束优化收敛证明。

英文摘要:

The Nelder-Mead algorithm, a longstanding direct search method for unconstrained optimization published in 1965, is designed to minimize a scalar-valued function f of n real variables using only function values, without any derivative information. Each Nelder-Mead iteration is associated with a nondegenerate simplex defined by n+1 vertices and their function values; a typical iteration produces a new simplex by replacing the worst vertex by a new point. Despite the method's widespread use, theoretical results have been limited: for strictly convex objective functions of one variable with bounded level sets, the algorithm always converges to the minimizer; for such functions of two variables, the diameter of the simplex converges to zero, but examples constructed by McKinnon show that the algorithm may converge to a nonminimizing point. This paper considers the restricted Nelder-Mead algorithm, a variant that does not allow expansion steps. In two dimensions we show that, for any nondegenerate starting simplex and any twice-continuously differentiable function with positive definite Hessian and bounded level sets, the algorithm always converges to the minimizer. The proof is based on treating the method as a discrete dynamical system, and relies on several techniques that are non-standard in convergence proofs for unconstrained optimization.

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

↑