Convergence of the Nelder-Mead simplex method to a nonstationary point

被引:262
|
作者
Mckinnon, KIM [1 ]
机构
[1] Univ Edinburgh, Dept Math & Stat, Edinburgh EH9 3JZ, Midlothian, Scotland
关键词
Nelder-Mead method; direct search; simplex; unconstrained optimization;
D O I
10.1137/S1052623496303482
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
This paper analyzes the behavior of the Nelder-Mead simplex method for a family of examples which cause the method to converge to a nonstationary point. All the examples use continuous functions of two variables. The family of functions contains strictly convex functions with up to three continuous derivatives. In all the examples the method repeatedly applies the inside contraction step with the best vertex remaining fixed. The simplices tend to a straight line which is orthogonal to the steepest descent direction. It is shown that this behavior cannot occur for functions with more than three continuous derivatives. The stability of the examples is analyzed.
引用
收藏
页码:148 / 158
页数:11
相关论文
共 50 条