public class GlobalSearchByLocalMinimizer extends SimpleGridMinimizer
SimpleGridMinimizer.NewCellFactoryCtor, SimpleGridMinimizer.Solution
DEFAULT_STABLE_ITERATION_COUNT, epsilon, factoryCtor, maxIterations, nStableIterations, uniform
Constructor and Description |
---|
GlobalSearchByLocalMinimizer()
Construct a
GlobalSearchByLocalMinimizer to solve unconstrained minimization
problems. |
GlobalSearchByLocalMinimizer(LocalSearchCellFactory.MinimizerFactory factory,
RandomLongGenerator uniform,
double epsilon,
int maxIterations,
int nStableIterations)
Construct a
GlobalSearchByLocalMinimizer to solve unconstrained minimization
problems. |
GlobalSearchByLocalMinimizer(RandomLongGenerator uniform,
double epsilon,
int maxIterations)
Construct a
GlobalSearchByLocalMinimizer to solve unconstrained minimization
problems. |
public GlobalSearchByLocalMinimizer(LocalSearchCellFactory.MinimizerFactory factory, RandomLongGenerator uniform, double epsilon, int maxIterations, int nStableIterations)
GlobalSearchByLocalMinimizer
to solve unconstrained minimization
problems.factory
- a factory that constructs a new instance of Minimizer
for
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.public GlobalSearchByLocalMinimizer(RandomLongGenerator uniform, double epsilon, int maxIterations)
GlobalSearchByLocalMinimizer
to solve unconstrained minimization
problems.uniform
- a uniform random number generatorepsilon
- a precision parameter: when a number |x| ≤ ε, it is
considered 0maxIterations
- the maximum number of iterationspublic GlobalSearchByLocalMinimizer()
GlobalSearchByLocalMinimizer
to solve unconstrained minimization
problems.Copyright © 2010-2020 NM FinTech Ltd.. All Rights Reserved.