= Basin-hopping
{wiki=Basin-hopping}
Basin-hopping is a global optimization technique used to find the minimum of a function that may have many local minima. It is particularly useful for problems where the objective function is complex, non-convex, or high-dimensional. The method combines two key components: local minimization and random sampling. Here's a brief overview of how basin-hopping works: 1. **Initial Guess**: The algorithm starts with an initial point in the search space.
Back to article page