Stochastic programming with finite number of experiments (original) (raw)

Access this article

Log in via an institution

Subscribe and save

• Starting from 10 chapters or articles per month
• Access and download chapters and articles from more than 300k books and 2,500 journals
• Cancel anytime View plans

Buy Now

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

Instant access to the full article PDF.

Literature Cited

1. Yu. M. Ermol'ev, “Methods of generalized stochastic gradients,” Kibernetika, No. 2 (1969).
2. M. Wasan, Stochastic Approximation, Cambridge University Press (1969).
3. Yu. Yu. Finkel'shtein and A. A. Korbut, Discrete Programming [in Russian], Nauka (1971).
4. Yu. Ermol'ev and I. M. Mel'nik, Extremal Problems in Graphs [in Russian], Naukova Dumka (1968).
5. E. Leman, Statistical Hypothesis Testing [in Russian], Nauka (1964).

Download references