| ON THE OPTIMALITY IN GENERAL SENSE FOR ODD-BLOCK SEARCH |
| |
| 作者姓名： | 陈木法 黄丹华 |
| |
| 作者单位： | CHEN MUFA (Department of Mathematics，Beijing Normal Universzty，Beijing 100875，China) HUANG DANHUA (Department of Mathematics，Fujian Normal University，Fuzhou 350007，China) |
| |
| 摘 要： | ＯＮＴＨＥＯＰＴＩＭＡＬＩＴＹＩＮＧＥＮＥＲＡＬＳＥＮＳＥＦＯＲＯＤＤ－ＢＬＯＣＫＳＥＡＲＣＨ￥ＣＨＥＮＭＵＦＡ（陈木法）（ＤｅｐａｒｔｍｅｎｔｏｆＭａｔｈｅｍａｔｉｃｓ，ＢｅｉｊｉｎｇＮｏｒｍａｌＵｎｉｖｅｒｓｚｔｙ，Ｂｅｉｊｉｎｇ１００８７５，Ｃ...
|
| 收稿时间： | 5 September 1992 |
On the optimality in general sense for odd-block search |
| |
| Mufa Chen,Danhua Huang.ON THE OPTIMALITY IN GENERAL SENSE FOR ODD-BLOCK SEARCH[J].Acta Mathematicae Applicatae Sinica,1995,11(4):389-404. |
| |
| Authors: | Mufa Chen Danhua Huang |
| |
| Institution: | (1) Department of Mathematics, Beijing Normal University, 100875 Beijing, China;(2) Department of Mathematics, Fujian Normal University, 350007 Fuzhou, China |
| |
| Abstract: | In his classical article3], J. Kiefer introduced the Fibonacci search as a direct optimal method. The optimality was proved under the restriction: the total number of tests is given in advance and fixed. To avoid this restriction, some different concepts of optimality were proposed and some corresponding optimal methods were obtained in 1], 2], 5] and 6]. In particular, the even-block search was treated in 1]. This paper deals with the odd-block search. The main result is Theorem 1.15. |
| |
| Keywords: | Fibonacci search golden section search odd-block search optimality in general |
| 本文献已被 CNKI SpringerLink 等数据库收录！ |
