The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.09 - September (1974 vol.23)
pp: 890-897
K.K. Burhardt , 3M Company
ABSTRACT
A very fast nongradient procedure for function optimization is described. The procedure is based on the ideas of Rosenbrock [1] and Swann [2]. These were modified and refined to obtain an algorithm which provides an optimum with a very small number of function evaluations. This algorithm, compared with recently reported algorithms by Lawrence and Steglitz (L-S) [3], and Beltrami and Indusi (B-I) [4], appears to be very robust and reliable. Constrained optimization problems can be handled and a special method for handling optimization with linear constraints is presented.
INDEX TERMS
Adaptive algorithms, mathematical programming, optimization.
CITATION
K.K. Burhardt, "An Adaptive Search Optimization Algorithm", IEEE Transactions on Computers, vol.23, no. 9, pp. 890-897, September 1974, doi:10.1109/T-C.1974.224052
15 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool