Skip to main content
Log in

Random minimization with the application of the best test algorithm

  • 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. L. V. Kantorovich and G. P. Akilov, Functional Analysis in Normed Spaces, Macmillan, New York (1964).

    Google Scholar 

  2. E. S. Levitin and B. T. Polyak, “Minimization methods under the presence of constraints,” Zh. Vychisl. Mat. i Mat. Fiz.,6, No. 5 (1966).

    Google Scholar 

  3. K. Vetters, “Quadratische Approximations Methoden zur konvexen Optimierung,” Z. Angew. Math. Mech.,50, No. 8 (1970).

  4. L. A. Rastrigin, Random Search in the Problems of Optimization of Multiparameter Systems [in Russian], Zinatne, Riga (1965).

    Google Scholar 

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

    Google Scholar 

Download references

Authors

Additional information

Translated from Kibernetika, No. 3, pp. 102–105, May–June, 1975.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Guseva, O.V. Random minimization with the application of the best test algorithm. Cybern Syst Anal 11, 455–459 (1975). https://doi.org/10.1007/BF01069473

Download citation

  • Received:

  • Issue Date:

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

Keywords

Navigation