On convergence of algorithms for broad classes of objective functions
Volume 3, Issue 2 (1992), pp. 275–279
Pub. online: 1 January 1992
Type: Research Article
Published
1 January 1992
1 January 1992
Abstract
In some recent papers a discussion on global minimization algorithms for a broad class of functions was started. An idea is presented here why such a case is different from a case of Lipshitzian functions in respect with the convergence and why for a broad class of functions an algorithm converges to global minimum of an objective function if it generates an everywhere dense sequence of trial points.