This is a preview of subscription content, log in via an institution to check access.
Literature Cited
B. T. Polyak, “Convergence and convergence rate of iterative stochastic algorithms. I. General case,” Avtomat. Telemekh., No. 12, 83–94 (1976).
Yu. M. Kaniovskii, P. S. Knopov, and Z. V. Nekrylova, Limit Theorems for Stochastic Programming Processes [in Russian], Naukova Dumka, Kiev (1980).
M. B. Nevel'son and R. Z. Khas'minskii, Stochastic Approximation and Recursive Estimation [in Russian], Nauka, Moscow (1972).
A. P. Korostelev, “On multistep stochastic approximation procedures,” Avtomat. Telemekh., No. 5, 82–90 (1981).
A. M. Gupal and L. G. Bazhenov, “A stochastic counterpart of the conjugate gradient method,” Kibernetika, No. 1, 125–126 (1972).
B. T. Polyak, “Comparison of convergence rate of one-step and multistep optimization algorithms in the presence of noise,” Izv. Akad. Nauk SSSR, Tekh. Kibern., No. 1, 9–12 (1977).
Yu. M. Ermol'ev, Stochastic Programming Methods [in Russian], Nauka, Moscow (1976).
I. I. Gikhman and A. V. Skorokhod, Theory of Stochastic Processes [in Russian], Vol. 3, Nauka, Moscow (1975).
Additional information
Translated from Kibernetika, No. 4, pp. 102–106, 131, July–August, 1984.
Rights and permissions
About this article
Cite this article
Kaniovskii, Y.M. Stochastic optimization algorithms with slowly decreasing step. Cybern Syst Anal 20, 593–600 (1984). https://doi.org/10.1007/BF01068935
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01068935