Class GlobalSearchByLocalMinimizer
- java.lang.Object
-
- dev.nm.solver.multivariate.geneticalgorithm.minimizer.simplegrid.SimpleGridMinimizer
-
- dev.nm.solver.multivariate.geneticalgorithm.minimizer.local.GlobalSearchByLocalMinimizer
-
- All Implemented Interfaces:
Minimizer<OptimProblem,IterativeSolution<Vector>>,IterativeMinimizer<OptimProblem>,MultivariateMinimizer<OptimProblem,IterativeSolution<Vector>>,Optimizer<OptimProblem,IterativeSolution<Vector>>
public class GlobalSearchByLocalMinimizer extends SimpleGridMinimizer
This minimizer is a global optimization method. It puts a mesh over the feasible region and then locally searches (optimizes) the neighborhood around each mesh point. The algorithm tries to escape the local minimums by crossing over other local minimums using a genetic algorithm. The local search (mutation) is performed by a typical local minimization method, such as Nelder-Mead, BFGS.
-
-
Nested Class Summary
-
Nested classes/interfaces inherited from class dev.nm.solver.multivariate.geneticalgorithm.minimizer.simplegrid.SimpleGridMinimizer
SimpleGridMinimizer.NewCellFactoryCtor, SimpleGridMinimizer.Solution
-
-
Field Summary
-
Fields inherited from class dev.nm.solver.multivariate.geneticalgorithm.minimizer.simplegrid.SimpleGridMinimizer
DEFAULT_STABLE_ITERATION_COUNT, epsilon, factoryCtor, maxIterations, nStableIterations, uniform
-
-
Constructor Summary
Constructors Constructor Description GlobalSearchByLocalMinimizer()Construct aGlobalSearchByLocalMinimizerto solve unconstrained minimization problems.GlobalSearchByLocalMinimizer(LocalSearchCellFactory.MinimizerFactory factory, RandomLongGenerator uniform, double epsilon, int maxIterations, int nStableIterations)Construct aGlobalSearchByLocalMinimizerto solve unconstrained minimization problems.GlobalSearchByLocalMinimizer(RandomLongGenerator uniform, double epsilon, int maxIterations)Construct aGlobalSearchByLocalMinimizerto solve unconstrained minimization problems.
-
-
-
Constructor Detail
-
GlobalSearchByLocalMinimizer
public GlobalSearchByLocalMinimizer(LocalSearchCellFactory.MinimizerFactory factory, RandomLongGenerator uniform, double epsilon, int maxIterations, int nStableIterations)
Construct aGlobalSearchByLocalMinimizerto solve unconstrained minimization problems.- Parameters:
factory- a factory that constructs a new instance ofMinimizerfor each problemuniform- a uniform random number generatorepsilon- a precision parameter: when a number |x| ≤ ε, it is considered 0maxIterations- the maximum number of iterationsnStableIterations- The solution is considered converged if the minimum does not change over this many iterations.
-
GlobalSearchByLocalMinimizer
public GlobalSearchByLocalMinimizer(RandomLongGenerator uniform, double epsilon, int maxIterations)
Construct aGlobalSearchByLocalMinimizerto solve unconstrained minimization problems.- Parameters:
uniform- a uniform random number generatorepsilon- a precision parameter: when a number |x| ≤ ε, it is considered 0maxIterations- the maximum number of iterations
-
GlobalSearchByLocalMinimizer
public GlobalSearchByLocalMinimizer()
Construct aGlobalSearchByLocalMinimizerto solve unconstrained minimization problems.
-
-