This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
An Adaptive Search Optimization Algorithm
September 1974 (vol. 23 no. 9)
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.
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, Sept. 1974, doi:10.1109/T-C.1974.224052
Usage of this product signifies your acceptance of the Terms of Use.