Add Basin Hopping Global Optimization Algorithm with New Least Squares Interface #1122
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
This PR adds both a new unified interface for least squares minimization and a Basin Hopping implementation for global optimization.
ILeastSquaresMinimizer Interface
First, this PR introduces a standardized interface for nonlinear least squares minimization algorithms:
ILeastSquaresMinimizer
interfaceFindMinimum
method:Vector<double>
parameterdouble[]
parameterLevenbergMarquardtMinimizer
andTrustRegionMinimizerBase
to implement this interfaceBasin Hopping Implementation
Building on this interface, the PR adds a Basin Hopping algorithm for global optimization. Basin hopping is a stochastic algorithm that efficiently finds global minima in complex energy landscapes by combining random Monte Carlo steps with local optimization (Wikipedia).
Key features:
ILeastSquaresMinimizer
andIUnconstrainedMinimizer
interfacesLevenbergMarquardtMinimizer
,TrustRegionDogLegMinimizer
,TrustRegionNewtonCGMinimizer
BfgsMinimizer
,LimitedMemoryBfgsMinimizer
,ConjugateGradientMinimizer
,NewtonMinimizer
Note: This PR supersedes PR #1119 which only contained the interface portion of these changes.