Random Binary Search: A Randomizing Algorithm for Global Optimization in R¹

DOI10.1287/MOOR.11.4.651MaRDI QIDQ4726059zbMATH OpenOpenAlexFDO

Authors Eitan Zemel

Publication date 1986

Published in Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/moor.11.4.651

zbMATH Keywords

random binary searchsampling distributionstochastic global optimization

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Recommendations

• A note on stochastic search methods for global optimization
• scientific article; zbMATH DE number 4108054
• scientific article; zbMATH DE number 3862941
• Stochastic adaptive search for global optimization.
• scientific article; zbMATH DE number 3956832

Cited in

(10)

• Performance of global random search algorithms for large dimensions
• Can a randomized binary search have an \(O(1)\) complexity at least in practice?
• Increasing the attraction area of the global minimum in the binary optimization problem
• A note on stochastic search methods for global optimization
• scientific article; zbMATH DE number 4068619 (Why is no real title available?)
• scientific article; zbMATH DE number 4108054 (Why is no real title available?)
• The Greedy Search Algorithm on Binary Vectors
• scientific article; zbMATH DE number 1241397 (Why is no real title available?)
• On the Optimality of Randomized \alpha-\beta Search
• scientific article; zbMATH DE number 5061888 (Why is no real title available?)

This page was built for publication: Random Binary Search: A Randomizing Algorithm for Global Optimization in $R^1$

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