Abstract
In order to represent a line-search algorithm as a non-convergent dynamic system, we perform a renormalisation of the uncertainty interval at each iteration. Its ergodic behaviour can then be studied, and it happens that, for locally symmetric functions, the asymptotic performances of the algorithm suggested are far better than those of the well-known GoldenSection algorithm. A proper tuning of internal parameters is then performed to obtain good performances for a finite number of iterations. The case of a function symmetric with respect to its optimum is considered first. An algorithm is presented, that only uses function comparisons,with a significant reduction of the number of comparisons required to reach a given precision when compared to the Golden Section algorithm. The robustness of these performances with respectto non-symmetry of the function is then checked by numerical simulations.
Similar content being viewed by others
References
D.-Z. Du and F.K. Hwang, Combinatorial Group Testing and its Applications, World Scientific: Singapore, 1993.
J.-P. Eckmann and D. Ruelle, “Ergodic theory of chaos and strange attractors,” Rev. Mod. Phys., vol. 57, pp. 617–656, 1985.
J. Kiefer, “Optimum sequential search and approximation methods under minimum regularity assumptions,” J. Soc. Indust. Appl. Math., vol. 5,no. 3, pp. 105–136, 1957.
L. Pronzato, H.P. Wynn, and A.A. Zhigljavsky, “Dynamic systems in search and optimisation,” CWI Quarterly, vol. 8,no. 3, pp. 201–236, 1995.
L. Pronzato, H.P. Wynn, and A.A. Zhigljavsky, “Stochastic analysis of convergence via dynamic representation for a class of line-search algorithms,” Combinatorics, Probability and Computing, vol. 6, pp. 205–229, 1997.
H.P. Wynn and A.A. Zhigljavsky, “Chaotic behaviour of search algorithms,” Acta Applicandae Mathematicae, vol. 32, pp. 123–156, 1993.
H.P. Wynn and A.A. Zhigljavsky, “Achieving the ergodically optimal convergence rate for a one-dimensional minimization problem,” J. of Complexity, vol. 11, pp. 196–226, 1994.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Pronzato, L., Wynn, H. & Zhigljavsky, A. Finite Sample Behaviour of an Ergodically Fast Line-Search Algorithm. Computational Optimization and Applications 14, 75–86 (1999). https://doi.org/10.1023/A:1008757012582
Issue Date:
DOI: https://doi.org/10.1023/A:1008757012582