A note on continuous search algorithms

DOI10.2307/3214081MaRDI QIDQ3753805zbMATH OpenOpenAlexFDO

Authors

Publication date 1987

Published in Journal of Applied Probability (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/3214081

zbMATH Keywords

average complexityContinuous random search methodsroot location methods

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Search theory (90B40)

Recommendations

• On the complexity of the search of an extremum of a function
• scientific article; zbMATH DE number 4116313
• Speed of convergence as a function of given accuracy for random search methods
• scientific article; zbMATH DE number 3862941
• scientific article; zbMATH DE number 3920191

Cited in

(2)

• On the complexity of the search of an extremum of a function
• scientific article; zbMATH DE number 2242588 (Why is no real title available?)

This page was built for publication: A note on continuous search algorithms

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