A Scaled Stochastic Approximation Algorithm
Sigrún Andradöttir
Additional contact information
Sigrún Andradöttir: Department of Industrial Engineering, University of Wisconsin---Madison, 1513 University Avenue, Madison, Wisconsin 53706
Management Science, 1996, vol. 42, issue 4, 475-498
Abstract:
Consider a stochastic system of such complexity that its performance can only be evaluated by using simulation or direct experimentation. To optimize the expected performance of such systems as a function of several continuous input parameters (decision variables), we present a "scaled" stochastic approximation algorithm for finding the zero (root) of the gradient of the response function. In each iteration of the scaled algorithm, two independent gradient estimates are sampled at the current estimate of the optimal input-parameter vector to compute a scale-free estimate of the next search direction. We establish sufficient conditions to ensure strong consistency and asymptotic normality of the resulting estimator of the optimal input-parameter vector. Strong consistency is also established for a variant of the scaled algorithm with Kesten's acceleration. An experimental performance comparison of the scaled algorithm and the classical Robbins-Monro algorithm in two simple queueing systems reveals some of the practical advantages of the scaled algorithm.
Keywords: stochastic optimization; root finding; simulation; the Robbins-Monro algorithm; the Kiefer-Wolfowitz algorithm; Kesten's acceleration (search for similar items in EconPapers)
Date: 1996
References: Add references at CitEc
Citations: View citations in EconPapers (6)
Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.42.4.475 (application/pdf)
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:inm:ormnsc:v:42:y:1996:i:4:p:475-498
Access Statistics for this article
More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().