Global optimization by random perturbation of the gradient method with a fixed parameter (Q1337130): Difference between revisions
From MaRDI portal
Latest revision as of 09:04, 23 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Global optimization by random perturbation of the gradient method with a fixed parameter |
scientific article |
Statements
Global optimization by random perturbation of the gradient method with a fixed parameter (English)
0 references
30 October 1994
0 references
An objective function is supposed multimodal, bounded and differentiable, and a feasible region is a ball in Euclidean space. The algorithm is the implementation of a randomly perturbed gradient method. The perturbation is a random vector \(Z\) multiplied by the decreasing factor converging to zero where \(Z\) almost surely belongs to the feasible region. Convergence with probability 1 is proved. Results of experiments are reported.
0 references
global optimization
0 references
Monte Carlo methods
0 references
randomly perturbed gradient method
0 references
0 references