Abstract
In this paper, we apply the random walk model in designing a raindrop algorithm to find the global optimal solution of a non-linear programming problem. The raindrop algorithm does not require the information of the first or second order derivatives of the object function. Hence it is a direct method. We investigate the properties of raindrop algorithm. Besides, we apply the raindrop algorithm to solve a non-linear optimization problem, where the object function is highly irregular (neither convex nor concave). And the global optimal solution can be found with small number of iterations.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.