This is a preview of subscription content, log in via an institution to check access.
Literature Cited
D. I. Batishchev, R. I. Bednaya, and R. G. Strongin, “On the selection of parameters of search optimization algorithms” Avtom. Vychisl. Tekhn., No. 5, 56–60 (1972).
V. V. Zakharov, “On comparison of methods of solving multiextremal problems,” Search for Extremums (Mathematical Methods and Automatic Systems) [in Russian], Izd. Gos. Univ., Tomsk (1969), pp. 318–322.
L. A. Rastrigin and K. K. Riga, “Comparison of steepest descent and random search with training methods,” in: Problems of Statistical Optimization [in Russian], Zinatne, Riga (1968), pp. 87–92.
V. V. Shkvartsov and N. N. Orlenko, “Experience with an experimental comparison of random search algorithms,” in: Problems of Statistical Optimization [in Russian], Zinatne, Riga (1969), pp. 93–98.
L. S. Gurlin, “On the question of a comparative estimate of different optimization methods,” Avtom. Vychisl. Tekhn., No. 10, 13–26 (1965).
Yu. G. Polyak, “On the question of an experimental investigation of extremum search algorithms,” Avtom. Vychisl. Tekhn., No. 10, 15–16 (1968).
D. I. Batishchev, Search Methods of Optimal Design [in Russian], Sovet-skoe Radio, Moscow (1975).
R. G. Strongin, Numerical Methods in Multiextremal Problems [in Russian], Nauka, Moscow (1978).
E. D. Eason and R. G. Fenton, “Comparison of numerical optimization methods for engineering design,” Konstr. Tekhnolog. Mashinostr.,96, No. 1, 196–200 (1974).
I. B. Lazarev and V. P. Valuiskikh, “Experimental comparison of random search algorithms,” Avtom. Vychisl. Tekhn., No. 2, 57–60 (1974).
D. Himmelblau, Applied Nonlinear Programming, McGraw-Hill (1972).
M. Aoki, Introduction to Optimization Techniques, Macmillan (1971).
A. R. Colville, A Comparative Study of Nonlinear Programming Codes, Tech. Report No. 320-2949, IBM Science Center, New York (1968).
M. J. Box, “A comparison of several current optimization methods and the use of transformations in constrained problems,” Comput. J. No. 9, 67–77 (1966).
J. Kowalik and M. R. Osborne, Methods for Unconstrained Optimization Problems, American Elsevier, New York (1968).
E. D. Eason and R. G. Fenton, Testing and Evaluation of Numerical Methods for Design Optimization, UTME-TP 7204, Univ. of Toronto (1972).
J. Szymanowski and J. Brzostek, “Comparison of statistical gradient-free optimization methods,” Arch. Automat. Telemech.,16, No. 1, 81–96 (1971).
I. A. Assadi, “A computational comparison of some nonlinear programs,” Math. Programming,4, No. 2, 144–154 (1973).
F. A. Lootsma, “Penalty function performance of some unconstrained minimization techniques,” Philips Res. Rep.,27, No. 4, 358–385 (1972).
O. I. Larichev and G. G. Gorvits, “New approach to comparison of search methods used in nonlinear programming problems,” J. Opt. Theory. Appl.,13, No. 6, 635–639 (1974).
M. Pappas, “Characteristic of the ‘design algorithm by the direct search method’ as a numerical optimization method,” AIAA J., No. 6, 146–148 (1975).
I. M. Gel'fand, E. B. Vul, S. L. Ginzburg, and Yu. G. Fedorov, Gullies Method in X-Ray Structural Analysis Problems [in Russian], Nauka, Moscow (1966).
F. L. Chernous'ko and N. V. Banichuk, Variational Problems of Mechanics and Control [in Russian], Nauka, Moscow (1973).
M. Pappas, “Configuration method in optimization problems,” Dinamik. Sist. Uprav., No. 2, 131–138 (1972).
Additional information
Translated from Kibernetika, No. 1, pp. 77–80, 84, January–February, 1984.
Rights and permissions
About this article
Cite this article
Kalinin, I.N. The question of investigation and comparison of optimization algorithms. Cybern Syst Anal 20, 117–123 (1984). https://doi.org/10.1007/BF01068877
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01068877