Stopping rules in <Emphasis Type="Italic">k</Emphasis>-adaptive global random search algorithms |
| |
Authors: | Anatoly Zhigljavsky Emily Hamilton |
| |
Institution: | (1) School of Mathematics, Cardiff University, Cardiff, UK; |
| |
Abstract: | In this paper we develop a methodology for defining stopping rules in a general class of global random search algorithms that
are based on the use of statistical procedures. To build these stopping rules we reach a compromise between the expected increase
in precision of the statistical procedures and the expected waiting time for this increase in precision to occur. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |