On Random Search for a Global Extremum

DOI10.1137/1128008MaRDI QIDQ3219372zbMATH OpenOpenAlexFDO

Authors A. Zhigljavsky, Sergeĭ Mikhaĭlovich Ermakov

Publication date 1984

Published in Theory of Probability & Its Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/1128008

zbMATH Keywords

random searchtransition functionweak convergence

Mathematics Subject Classification ID

Existence theories for problems in abstract spaces (49J27) Numerical methods in optimal control (49M99) Distribution theory (60E99) Statistical distribution theory (62E99) Numerical mathematical programming methods (65K05) Stochastic programming (90C15)

Recommendations

• scientific article; zbMATH DE number 4108054
• Comparison of some random search procedures for a global extremum
• scientific article; zbMATH DE number 3987065
• scientific article; zbMATH DE number 4010224
• A random search approach to finding the global minimum
• scientific article; zbMATH DE number 3920191
• scientific article; zbMATH DE number 3936952
• scientific article; zbMATH DE number 519990
• scientific article; zbMATH DE number 4041633

Cited in

(5)

• Use of random search in solving discrete extremal problems
• The Shape of a Local Minimum and the Probability of its Detection in Random Search
• scientific article; zbMATH DE number 3936952 (Why is no real title available?)
• scientific article; zbMATH DE number 519990 (Why is no real title available?)
• Average case behavior of random search for the maximum

This page was built for publication: On Random Search for a Global Extremum

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