Global Optimization using Dynamic Search Trajectories

Authors:
Albert A. Groenwold;J. A. Snyman
Affiliations:
Department of Mechanical Engineering, University of Pretoria, Pretoria, 0002, South Africae-mail: Albert.Groenwold@eng.up.ac.za;Department of Mechanical Engineering, University of Pretoria, Pretoria, 0002, South Africae-mail: Jan.Snyman@eng.up.ac.za)
Venue:
Journal of Global Optimization
Year:
2002

Citing 3
Cited 2

A multi-start global minimization algorithm with dynamic search trajectories

Journal of Optimization Theory and Applications
Random tunneling by means of acceptance-rejection sampling for global optimization

Journal of Optimization Theory and Applications
Global optimization

Global optimization

A Combined Global & Local Search (CGLS) Approach to Global Optimization

Journal of Global Optimization
The application of a unified Bayesian stopping criterion in competing parallel algorithms for global optimization

Computers & Mathematics with Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Two global optimization algorithms are presented. Both algorithms attempt to minimize an unconstrained objective function through the modeling of dynamic search trajectories. The first, namely the Snyman–Fatti algorithm, originated in the 1980's and still appears an effective global optimization algorithm. The second algorithm is currently under development, and is denoted the modified bouncing ball algorithm. For both algorithms, the search trajectories are modified to increase the likelihood of convergence to a low local minimum. Numerical results illustrate the effectiveness of both algorithms.