Achieving the ergodically optimal convergence rate for a one-dimensional minimization problem

DOI10.1006/JCOM.1995.1008MaRDI QIDQ1893073zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Henry P. Wynn, A. Zhigljavsky

Publication date 3 July 1995

Published in Journal of Complexity (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jcom.1995.1008

zbMATH Keywords

almost sure optimality

Mathematics Subject Classification ID

Searching and sorting (68P10) Parallel algorithms in computer science (68W10)

Recommendations

• scientific article; zbMATH DE number 862330
• scientific article; zbMATH DE number 822890
• The chaotic behaviour of search algorithms
• One-dimensional P-algorithm with convergence rate \(O(n^{-3+\delta})\) for smooth functions
• A one-dimensional optimization algorithm and its convergence rate under the Wiener measure

Cited in

(3)

• An efficient interfacing of golden-section and quadratic searches
• Golden ratio and symmetric cutting out
• One-dimensional P-algorithm with convergence rate \(O(n^{-3+\delta})\) for smooth functions

This page was built for publication: Achieving the ergodically optimal convergence rate for a one-dimensional minimization problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1893073)