Skip to main content
SpringerLink
Log in

Convergence of a random-search algorithm

  • Published:
Cybernetics Aims and scope

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Literature Cited

  1. Ya. S. Rubinshtein, “Convergence of random-search algorithms,” Avtomat. i Vychislit. Tekh. No. 1 (1969).

  2. L. A. Rastrigin, Statistical Search Methods [in Russian], Izd. Nauka, Moscow (1968).

    Google Scholar 

  3. N. Z. Shor, “Speed of convergence of the generalized gradient descent method,” Kibernetika, No. 3 (1968).

  4. W. Feller, An Introduction to Probability Theory and Its Applications, Vol. 2, Wiley, New York (1950).

    Google Scholar 

Download references

Authors
  1. O. V. Guseva
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 6, pp. 143–145, November–December, 1971.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Guseva, O.V. Convergence of a random-search algorithm. Cybern Syst Anal 7, 1104–1106 (1971). https://doi.org/10.1007/BF01068842

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation