Skip to main content
Log in

Parametric statistical estimators in multistep random-search algorithms

  • Published:
Cybernetics Aims and scope

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Literature Cited

  1. Ya. V. Tsypkin, “Generalized learning algorithms,” Avtomat. i Telemekhan., No. 1 (1970).

  2. Yu. M. Ermol'ev, “On a certain general stochastic-programming problem,” Kibernetika, No. 3 (1971).

  3. V. Ya. Katkovnik, “The method of averaging operators in iteration algorithms for the solution of stochastic extremal problems,” Kibernetika, No. 4 (1972).

  4. V. Ya. Katkovnik and L. V. Ovcharova, “Convergence and convergence rate of parametric statistical gradients,” Kibernetika, No. 2 (1974).

Download references

Authors

Additional information

Translated from Kibernetika, No. 3, pp. 94–100, May–June, 1974.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Katkovnik, V.Y., Ovcharova, O.V. Parametric statistical estimators in multistep random-search algorithms. Cybern Syst Anal 10, 483–491 (1974). https://doi.org/10.1007/BF01068717

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01068717

Keywords

Navigation