A multi-start global minimization algorithm with dynamic search trajectories

From MaRDI portal





A new multi-start algorithm for global unconstrained minimization is presented in which the search trajectories are derived from the equation of motion of a particle in a conservative force field, where the function to be minimized represents the potential energy. The trajectories are modified to increase the probability of convergence to a comparatively low local minimum, thus increasing the region of convergence of the global minimum. A Bayesian argument is adopted by which, under mild assumptions, the confidence level that the global minimum has been attained may be computed. When applied to standard and other test functions, the algorithm never failed to yield the global minimum.




Cited in
(32)


Describes a project that uses

Uses Software






This page was built for publication: A multi-start global minimization algorithm with dynamic search trajectories

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1078079)