Leap Gradient Algorithm
The paper proposes a new algorithm for solving global univariate optimization problems. The algorithm does not require convexity of the target function. For a broad variety of target functions after performing (if necessary) several evolutionary leaps the algorithm naturally becomes the standard descent (or ascent) procedure near the global extremum. Moreover, it leads us to an efficient numerical method for calculating the global extrema of univariate real analytic functions.
PDF AbstractCategories
Optimization and Control
11C08, 49M30, 65K99, 68W05, 13P05, 26C10, 30C10, 65H04
G.1.0; G.4; I.1.2; F.2.1; G.1.5; G.1.6
