摘要
本文研究了优选法中一维搜索区间趋于零的充要条件.利用建立的对称截去模型,证明0.618法(优选法)是最快的算法.
In this paper, by using a model named symmetric cutting out, a necessary and sufficient condition for interval of search tending to zero is obtained. By the model, we may further conclude that the 0. 618 method （optimum seeking method） is the most rapid convergence algorism for interval of search tending to zero.
出处
《数学杂志》
CSCD
北大核心
2009年第3期391-394,共4页
Journal of Mathematics
关键词
黄金分割比
优选法
搜索区间
golden section,optimum seeking method,interval search
