Skip to main content
SpringerLink
Log in

Random minimization without calculation of derivatives

  • 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. B. T. Polyak, “Minimization of nonsmooth functionals,” Zh. Vychislitel'. Matem. i Matem. Fiz.,9, No. 3 (1969).

  2. L. A. Rastrigin, Random Search [in Russian], Izd. Zinatne, Riga (1965).

    Google Scholar 

  3. M. A. Krasnosel'skii and Ya. B. Rutitskii, Convex Functions and Orlich Spaces, International Scholarly Book Service (1961).

  4. O. V. Guseva, “On convergence of random-minimization algorithms,” Kibernetika, No. 4 (1973).

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. 1, pp. 117–120, January–February, 1974.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Guseva, O.V. Random minimization without calculation of derivatives. Cybern Syst Anal 10, 148–153 (1974). https://doi.org/10.1007/BF01069032

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation