An adaptive randomized pattern search
- 1 December 1972
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 11, 421-425
- https://doi.org/10.1109/cdc.1972.269034
Abstract
The problem of functional minimization by means of random searching is discussed. Two previously proposed algorithms, Adaptive Step Size Random Search (ASSRS) and Randomized Pattern Search (RANPAT), are evaluated on several functions which were chosen so as to be difficult if not impossible to minimize using simple gradient search techniques. The experimental evaluation of the ASSRS and RANPAT algorithms leads to the development of a proposed hybrid random search algorithm, Adaptive Randomized Pattern Search (ARPS). Comparisons of these three algorithms indicates that ARPS is at least comparable to ASSRS and RANPAT on all the functions examined, and that ARPS is significantly better on the several functions which have constrained parameter spaces.Keywords
This publication has 6 references indexed in Scilit:
- Randomized Pattern SearchIEEE Transactions on Computers, 1972
- An evaluation of adaptive step-size random searchIEEE Transactions on Automatic Control, 1971
- Adaptive step size random searchIEEE Transactions on Automatic Control, 1968
- A Rapidly Convergent Descent Method for MinimizationThe Computer Journal, 1963
- A Review of Minimization Techniques for Nonlinear FunctionsSIAM Review, 1962
- `` Direct Search'' Solution of Numerical and Statistical ProblemsJournal of the ACM, 1961