Leap Gradient Algorithm

Polynomials in number theory (11C08) Polynomials, factorization in commutative rings (13P05) Real polynomials: location of zeros (26C10) Polynomials and rational functions of one complex variable (30C10) Numerical computation of roots of polynomial equations (65H04) Numerical methods for mathematical programming, optimization and variational techniques (65K99) Nonnumerical algorithms (68W05)

Abstract: 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.

This page was built for publication: Leap Gradient Algorithm

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