A stochastic steepest-descent algorithm
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.
- A stochastic steepest-descent algorithm
- An Adaptive Precision Gradient Method for Optimal Control
- Computational methods in optimization. A unified approach.
- Minimization of functions having Lipschitz continuous first partial derivatives
- Stochastic approximation algorithms for constrained optimization problems
- Stochastic approximation algorithms for the local optimization of functions with nonunique stationary points
- Stochastic approximation type methods for constrained systems: Algorithms and numerical results
- Stochastic Estimation of the Maximum of a Regression Function
- A stochastic Remes algorithm
- A stochastic steepest-descent algorithm
- A stochastic algorithm using one sample point per iteration and diminishing step-sizes
- Stochastic algorithms with Armijo stepsizes for minimization of functions
- Stochastic gradient algorithm with random truncations
- Optimization algorithm with probabilistic estimation
- Stochastic approximation algorithm for minimax problems
- Stochastic minimization with adaptive memory
- Continuous action set learning automata for stochastic optimization
- Steepest descent method with random step lengths
- Algorithm for stochastic approximation with trial input perturbation in the nonstationary problem of optimization
- Population based steepest descent method
- scientific article; zbMATH DE number 4014470 (Why is no real title available?)
- Descent direction method with line search for unconstrained optimization in noisy environment
- scientific article; zbMATH DE number 3936292 (Why is no real title available?)
- scientific article; zbMATH DE number 4091202 (Why is no real title available?)
- Multivariate stochastic approximation using a simultaneous perturbation gradient approximation
- scientific article; zbMATH DE number 1199852 (Why is no real title available?)
- Convergence Analysis of Stochastic Algorithms
- Stochastic three points method for unconstrained smooth minimization
- A nonmonotone line search method for stochastic optimization problems
- The Stochastic Fejér-Monotone Hybrid Steepest Descent Method and the Hierarchical RLS
- Minimization algorithms based on supervisor and searcher cooperation
- A stochastic gradient method for a class of nonlinear PDE-constrained optimal control problems under uncertainty
- How to optimize discrete-event systems from a single sample path by the score function method
This page was built for publication: A stochastic steepest-descent algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1093541)
