Paper Info
Title
Robustness of Isotropic Stable Mutations in a General Search Space
Abstract
One of the most serious problem concerning global optimization methods is their correct configuration. Usually algorithms are described by some number of external parameters for which optimal values strongly depend on the objective function. If there is a lack of knowledge on the function under consideration the optimization algorithms can by adjusted using trail-and-error method. Naturally, this kind of approach gives rise to many computational problems. Moreover, it can be applied only when a lot of function evaluations is allowed. In order to avoid trial-and-error method it is reasonable to use an optimization algorithm which is characterized by the highest degree of robustness according to the variations in its control parameters. In this paper, the robustness issue of evolutionary strategy with isotropic stable mutations is discussed. The experimental simulations are conducted with the help of special search environment - the so-called general search space.
Year
DOI
Venue
2008
10.1007/978-3-540-69731-2_45
ICAISC
Keywords
Field
DocType
computational problem,trial-and-error method,special search environment,optimization algorithm,function evaluation,global optimization method,isotropic stable mutations,objective function,so-called general search space,robustness issue,trail-and-error method,general search space,global optimization,evolutionary strategy,search space
Isotropy,Mathematical optimization,Computational problem,Global optimization,Computer science,Robustness (computer science),Evolution strategy,Optimization algorithm,Stable distribution
Conference
Volume
ISSN
Citations 
5097
0302-9743
0
PageRank 
References 
Authors
0.34
6
2
Name
Order
Citations
PageRank
Przemysław Pretki1213.26
Andrzej Obuchowicz27610.10