DIRECT SEARCH SOLUTION OF NUMERICAL AND STATISTICAL PROBLEMS
DIRECT SEARCH SOLUTION OF NUMERICAL AND STATISTICAL PROBLEMS
复制标题
DOI：
10.1145/321062.321069
复制
发表时间：
1961-01-01
影响因子：
2.5
通讯作者：
JEEVES, TA
中科院分区：
文献类型：
--
作者：
HOOKE, R;JEEVES, TA
在处理经典解法不可行的数值问题时，许多人尝试了在计算机上搜索答案的各种程序。我们在这方面的努力已经产生了一些程序，这些程序似乎已经（对我们和其他使用过它们的人来说）比其他地方取得的成功更多，因此，我们受到鼓舞，发表了这份研究报告。我们使用”直接搜索”一词来描述对试验解决方案的顺序检查，包括将每个试验解决方案与”最佳”方案进行比较。到那时为止获得的结果，以及用于确定（作为早期结果的函数）下一个试验解决方案的策略。这句话意味着我们的偏好，根据经验，直接的搜索策略，不采用经典分析的技术，除非有一个明显的优势。
In dealing with numerical problems for which classical methods of solution are unfeasible, many people have tried various procedures of searching for an answer on a computer. Our efforts in this direction have produced procedures which seem to have had (for us and for others who have used them) more success than has been achieved elsewhere, so that we have been encouraged to publish this report of our studies.We use the phrase" direct search" to describe sequential examination of trial solutions involving comparison of each trial solution with the" best" obtained up to that time together with a strategy for determining (as a function of earlier results) what the next trial solution will be. The phrase implies our preference, based on experience, for straightforward search strategies which employ no techniques of classical analysis except where there is a demonstrable advantage in doing so.