This is a preview of subscription content, log in to check access.
Buy single article
Instant access to the full article PDF.
Price includes VAT for USA
Subscribe to journal
Immediate online access to all issues from 2019. Subscription will auto renew annually.
This is the net price. Taxes to be calculated in checkout.
L. V. Kantorovich, “On the method of steepest descent,” Dokl. Akad. Nauk SSSR,56, 3 (1947).
L. A. Rastrigin, Random Search in Problems of Optimization of Multiparameter Systems [in Russian] Zinatne, Riga (1965).
S. M. Movshovich, “Random search and the gradient method in optimization problems,” Izv. Akad. Nauk SSSR, Tekh. Kibern., No. 6 (1966).
J. L. Doob, Stochastic Processes, Wiley, New York (1953).
E. G. Nikolaev, “On steepest descent based on the random m-gradient method,” Avtom. Vychisl. Tekh., No. 3 (1970)
E. G. Nikolaev, “On steepest descent with random selection of directions”, Avtom. Vychisl. Tekh., No. 5 (1970).
Translated from Kibernetika, No. 4, pp. 55–58, July–August, 1974.
About this article
Cite this article
Shor, N.Z., Shchepakin, M.B. Estimating the rate of convergence of the random search method. Cybern Syst Anal 10, 615–618 (1974). https://doi.org/10.1007/BF01071540
- Operating System
- Artificial Intelligence
- System Theory
- Search Method
- Random Search