BCR: A Simple and Efficient Method of Unidimensional Search by Elimination

[摘要] The algorithm proposed in this paper belongs to the methodological category of unidimensional search by elimination, and may be used, therefore, in the optimization of discontinuous functions. This new method is based on the dichotomous search algorithm and is, in many cases, superior to Fibonacci’s algorithm (up to the present considered the most efficient method of elimination), with the advantage of being much simpler.

[关键词] Unidimensional search;Elimination;Dicothomy