Analysis and parameter selection for an adaptive random search algorithm
β Scribed by Rajeeva Kumar; Pierre T. Kabamba; David C. Hyland
- Publisher
- Elsevier Science
- Year
- 2005
- Tongue
- English
- Weight
- 160 KB
- Volume
- 68
- Category
- Article
- ISSN
- 0378-4754
No coin nor oath required. For personal study only.
β¦ Synopsis
This paper presents an analysis of an adaptive random search (ARS) algorithm, a global minimization method. A probability model is introduced to characterize the statistical properties of the number of iterations required to find an acceptable solution. Moreover, based on this probability model, a new stopping criterion is introduced to predict the maximum number of iterations required to find an acceptable solution with a pre-specified level of confidence. Finally, this paper presents a systematic procedure for choosing the user-specified parameters in the ARS algorithm for fastest convergence. The results, which are valid for search spaces of arbitrary dimensions, are illustrated on a simple three-dimensional example.
π SIMILAR VOLUMES
In this paper, a new adaptive machine learning algorithm for analyzing and processing color images of natural scenes is presented . The eventual goal of this research is to obtain a mathematical training algorithm to guide the operation of an unsupervised pattern recognition and classification techn
A fast and efficient adapti¨e sampling algorithm is presented. This algorithm is applied to the aggressi¨e space mapping technique to minimize the number and to automate the selection of frequency sample points of the fine model, thus impro¨ing the efficiency of space mapping. The new technique is a