IEEE Transactions on Automatic Control · 1992 · 2.3K citations · 26 references
ComputingMathematicsOptimizationStochastic ModelingUncertainty QuantificationApproximation AlgorithmsFinite Difference MethodsNumerical AlgorithmsNumerical AnalysisPerturbation MethodsRoot FindingFinite Difference ApproximationMinimizationSimultaneous ApproximationStochastic Approximation
The problem of finding a root of the multivariate gradient equation that arises in function minimization is considered. When only noisy measurements of the function are available, a stochastic approximation (SA) algorithm for the general Kiefer-Wolfowitz type is appropriate for estimating the root. The paper presents an SA algorithm that is based on a simultaneous perturbation gradient approximation instead of the standard finite-difference approximation of Keifer-Wolfowitz type procedures. Theory and numerical experience indicate that the algorithm can be significantly more efficient than the standard algorithms in large-dimensional problems.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
26