Leap Gradient Algorithm
Published in arXiv (Cornell University) • May 21, 2014
Authors:
Sergey Nikitin
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 des...
Finding related papers...
Discussions
(0)No comments yet
Be the first to share your thoughts!