An Adaptive Random Search Algorithm for Constrained Minimization
- 1 September 1972
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-21 (9) , 1004-1008
- https://doi.org/10.1109/tc.1972.5009077
Abstract
The well-known pattern search method has been randomized by Lawrence and Steiglitz [4] in order to augment its ability to adapt to direction. In this note we introduce other refinements in order to make it more adaptive in step size, and the use of penalty terms is incorporated as so to accommodate constraints. This yields an algorithm that appears to be robust and reliable, as verified by numerical experimentation. Moreover, the method has low storage requirements and is insensitive to the initial choice of a search radius.Keywords
This publication has 6 references indexed in Scilit:
- Randomized Pattern SearchIEEE Transactions on Computers, 1972
- Adaptive step size random searchIEEE Transactions on Automatic Control, 1968
- Parameter optimization by random search using hybrid computer techniquesPublished by Association for Computing Machinery (ACM) ,1966
- A Rapidly Convergent Descent Method for MinimizationThe Computer Journal, 1963
- `` Direct Search'' Solution of Numerical and Statistical ProblemsJournal of the ACM, 1961
- Variational methods for the solution of problems of equilibrium and vibrationsBulletin of the American Mathematical Society, 1943