Locating the minimum of a function when the errors of observation have unknown density
- 11 Downloads
In considering the problem of locating the point θ at which a functionf achieves its minimum (or maximum) using the Kiefer-Wolfowitz (KW) stochastic approximation procedure, Abdelhamid  has shown that if the densityg of the errors obtained in estimating functional values is known, then a transformation of observations leads to methods which under mild conditions have desirable asymptotic properties. We address the more general problem of locating the point of minimum of a function wheng is unknown to the experimenter. In the procedure given in Theorem 4.1 we obtain the same asymptotic results as Abdelhamid in his version of the KW procedure.
KeywordsAsymptotic Normality Stochastic Approximation Unknown Density Random Variable Versus Measurable Random Variable
Unable to display preview. Download preview PDF.
- Fabian, V. (1964). A new one-dimensional stochastic approximation method for finding a local minimum of a function,Trans. Third Prague Conf. Information Theory, Statistical Decision Functions, Random Processes, Czechoslovak Academy of Sciences, Prague 85–105.Google Scholar
- Fabian, V. (1971). Stochastic approximation,Optimizing Methods in Statistics (ed. S. S. Rustagi), Academic Press, New York, 439–470.Google Scholar
- Loève, Michel (1963).Probability Theory, Third Edition, D. van Nostrand Company, Inc.Google Scholar