The Community for Technology Leaders
Green Image
Issue No. 09 - September (1974 vol. 23)
ISSN: 0018-9340
pp: 890-897
K.K. Burhardt , 3M Company
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.
Adaptive algorithms, mathematical programming, optimization.

K. Burhardt, "An Adaptive Search Optimization Algorithm," in IEEE Transactions on Computers, vol. 23, no. , pp. 890-897, 1974.
88 ms
(Ver 3.3 (11022016))