Abstract
Fibonacci search is a well-known one dimensional search technique used to optimize a unimodal function of one variable. It is optimal among all non-randomized search procedures with a given number of function evaluations in the sense that it yields the highest length ratio of beginning to ending interval of uncertainty. The purpose of this paper is to show that this property of optimality for a variation of the method, termed Extended Fibonacci Search, is preserved when it is applied to a class of functions which is more general than the unimodal class. This class is termed proper sinusoidal. The paper ends with a brief description of an application of this optimization approach to improve the efficiency of the TRANSYT traffic engineering computer program.
Preview
Unable to display preview. Download preview PDF.
References
M. Avriel, Nonlincar Programming, Prentice-Hall, New Jersey, 1976, pp 225–233.
L.R. Foulds, TRANSYT Traffic Engineering Program Efficiency Improvement vi Fibonacci Search. Transp. Research 20A, (1986), 331–335.
L.R. Foulds, Improving TRANSYT Traffic Program, Proceedings 24th Annual Conference, Operational Research Society of New Zealand, Auckland, New Zealand, August 18–19 (1988), pp 85–90.
Transport and Road Research Laboratory, Crowthorne, Berkshire, United Kingdom, Research Reports (1980): LR 253, SR 255 UN 78/11, LR 518, LR 888.
D. Wilde, C. Beightler, and D. Philips, Foundations of Optimization, 2nd ed. Prentice Hall, Reading, MA, 1980.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 International Federation for Information Processing
About this paper
Cite this paper
Foulds, L.R., Yu, W. (1990). Extended Fibonacci search for proper sinusoidal functions. In: Sebastian, H.J., Tammer, K. (eds) System Modelling and Optimization. Lecture Notes in Control and Information Sciences, vol 143. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0008362
Download citation
DOI: https://doi.org/10.1007/BFb0008362
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-52659-9
Online ISBN: 978-3-540-47095-3
eBook Packages: Springer Book Archive