On the Optimality in General Sense for Odd-Block Search
Probability
2014-11-24 v1 Optimization and Control
Abstract
In his classical article[3](1953), 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 me\-thods 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
Cite
@article{arxiv.1411.5748,
title = {On the Optimality in General Sense for Odd-Block Search},
author = {Mu-Fa Chen and Dan-Hua Huang},
journal= {arXiv preprint arXiv:1411.5748},
year = {2014}
}
Comments
Typos are corrected in this version