The chaotic behaviour of search algorithms

DOI10.1007/BF00998150zbMath0795.49024OpenAlexW2084803337WikidataQ61855987 ScholiaQ61855987MaRDI QIDQ1314871

Anatoly A. Zhigljavsky, Henry P. Wynn

Publication date: 14 September 1994

Published in: Acta Applicandae Mathematicae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00998150

zbMATH Keywords

chaosFibonaccisymmetric functionsergodic theorydynamic processasymptotic ratessecond-order line searchGolden Sectionalmost sure asymptotic rates of convergencebacktracking bifurcation algorithm

Mathematics Subject Classification ID

Management decision making, including multiple objectives (90B50) Strange attractors, chaotic dynamics of systems with hyperbolic behavior (37D45) Mathematical programming (90C99) Numerical methods in optimal control (49M99)

Related Items (1)

The theory of search from a statistical viewpoint. (With discussion)

Cites Work

• Optimum Sequential Search and Approximation Methods Under Minimum Regularity Assumptions
• Sequential Minimax Search for a Maximum
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The chaotic behaviour of search algorithms