Skip to main content
SpringerLink
Log in

Certain probabilistic estimates of algorithms for stochastic programming with constant step multipliers

  • 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. Yu. M. Ermol'ev, “On the method of generalized stochastic gradients and stochastic quasi-Fejér sequences,” Kibernetika, No. 2 (1969).

  2. E. A. Nurminskii, “Convergence conditions for algorithms of stochastic programming,” Kibernetika, No. 3 (1973).

  3. B. T. Polyak and Ya. Z. Tsypkin, “Pseudogradient algorithms for adaptation and learning,” Avtomat. Telemekh.,34, No. 3 (1973).

  4. M. T. Wasan, Stochastic Approximation, Cambridge Univ. Press (1969).

Download references

Authors
  1. I. V. Beiko
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. P. N. Zin'ko
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 2, pp. 91–95, March–April, 1978.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Beiko, I.V., Zin'ko, P.N. Certain probabilistic estimates of algorithms for stochastic programming with constant step multipliers. Cybern Syst Anal 14, 246–252 (1978). https://doi.org/10.1007/BF01069359

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation