A stochastic steepest-descent algorithm (Q1093541)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A stochastic steepest-descent algorithm |
scientific article |
Statements
A stochastic steepest-descent algorithm (English)
0 references
1988
0 references
A stochastic steepest-descent algorithm for function minimization under noisy observations is presented. Function evaluation is done by performing a number of random experiments on a suitable probability space. The number of experiments performed at a point generated by the algorithm reflects a balance between the conflicting requirements of accuracy and computational complexity. The algorithm uses an adaptive precision scheme to determine the number of random experiments at a point; this number tends to increase whenever a stationary point is approached, and to decrease otherwise. Two rules are used to determine the number of random experiments at a point: one, in the inner-loop of the algorithm, uses the magnitude of the observed gradient of the function to be minimized; and the other, in the outer-loop, uses a measure of accumulated errors in function evaluations at past points generated by the algorithm. Once a stochastic approximation of the function to be minimized is obtained at a point, the algorithm proceeds to generate the next point by using the steepest-descent deterministic methods of Armijo and Polak. Convergence of the algorithm to stationary points is demonstrated under suitable assumptions.
0 references
Armijo stepsize
0 references
stochastic steepest-descent algorithm
0 references
noisy observations
0 references
adaptive precision scheme
0 references
stochastic approximation
0 references
stationary points
0 references