A Conditional Gaussian Martingale Algorithm for Global Optimization
A new stochastic algorithm for determination of a global minimum of a real valued continuous function defined on K, a compact set of ℝ n , having an unique global minimizer in K is introduced and studied, a context discussion is presented and implementations are used to compare the performance of the algorithm with other algorithms. The algorithm may be thought to belong to the random search class but although we use Gaussian distributions, the mean is changed at each step to be the intermediate minimum found at the preceding step and the standard deviations, on the diagonal of the covariance matrix, are halved from one step to the next. The convergence proof is simple relying on the fact that the sequence of intermediate random minima is an uniformly integrable conditional Gaussian martingale.
KeywordsGlobal Optimization Random Search Preceding Step Stochastic Algorithm Random Search Algorithm
Unable to display preview. Download preview PDF.
- 5.Pintér, J.D.: Global optimization in action. Continuous and Lipschitz optimization: algorithms, implementations and applications. In: Nonconvex Optimization and Its Applications, vol. 6, p. xxvii. Kluwer Academic Publishers, Dordrecht (1996)Google Scholar
- 12.Zabinsky, Z.B.: Stochastic adaptive search for global optimization. In: Nonconvex Optimization and Its Applications, vol. 72, p. xviii. Kluwer Academic Publishers, Boston (2003)Google Scholar