Comparison of some random search procedures for a global extremum

DOI10.1016/0041-5553(89)90054-2MaRDI QIDQ3481174zbMATH OpenOpenAlexFDO

Authors A. Zhigljavsky, Marina V. Kondratovich, Sergeĭ Mikhaĭlovich Ermakov

Publication date 1989

Published in USSR Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0041-5553(89)90054-2

zbMATH Keywords

comparison of methodsiterationsMonte Carlo global maximum seeking algorithmsnumerical examplesrandom search procedure

Mathematics Subject Classification ID

Monte Carlo methods (65C05) Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Cited in

(4)

• Performance of global random search algorithms for large dimensions
• A CARTopt method for bound-constrained global optimization
• On Random Search for a Global Extremum
• The Shape of a Local Minimum and the Probability of its Detection in Random Search

This page was built for publication: Comparison of some random search procedures for a global extremum

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