| Stochastic approximation for Monte Carlo optimization |
| Full text |
Pdf
(621 KB)
|
| Source
|
Winter Simulation Conference
archive
Proceedings of the 18th conference on Winter simulation
table of contents
Washington, D.C., United States
Pages: 356 - 365
Year of Publication: 1986
ISBN:0-911801-11-1
|
|
Author
|
|
Peter W. Glynn
|
Department of Industrial Elngineering and Mathematics Research Center, University of Wisconsin--Madison, Madison, WI
|
|
| Sponsor |
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 12, Downloads (12 Months): 61, Citation Count: 20
|
|
|
ABSTRACT
In this paper, we introduce two convergent Monte Carlo algorithms for optimizing complex stochastic systems. The first algorithm, which is applicable to regenerative processes, operates by estimating finite differences. The second method is of Robbins-Monro type and is applicable to Markov chains. The algorithm is driven by derivative estimates obtained via a likelihood ratio argument.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
Chung, K. L. (1974). A Course in Probability The~. Academic Press, New York.
|
| |
2
|
Metivier, M. and Priouret, P. (1984). Applications of a Kushner and Clark lemma to general classes of stochastic algorithms. IEEE Trans. Inform. Theory 30, 140-151.
|
| |
3
|
Smith, W. L. (1955). Regenerative stochastic processes. Proc. Roy. Soc. A232, 6-31.
|
|