Comparison of some random search procedures for a global extremum

DOI10.1016/0041-5553(89)90054-2zbMath0702.65063OpenAlexW1998415688MaRDI QIDQ3481174

Anatoly 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 methodsnumerical examplesiterationsrandom search procedureMonte Carlo global maximum seeking algorithms

Mathematics Subject Classification ID

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

Related Items (1)

A CARTOPT METHOD FOR BOUND-CONSTRAINED GLOBAL OPTIMIZATION

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