| Interface | Description |
|---|---|
| BuildInitials |
Some optimization algorithms, e.g., Nelder–Mead, Differential-Evolution, require a set of initial points to work with.
|
| Class | Description |
|---|---|
| DefaultSimplex |
A simplex optimization algorithm, e.g., Nelder–Mead, requires an initial simplex to start the search.
|
| UniformDistributionOverBox1 |
This algorithm, by sampling uniformly in each dimension,
generates a set of initials uniformly distributed over a box region,
with some degree of irregularity or randomness.
|
| UniformDistributionOverBox2 |
This algorithm, by perturbing each grid point by a small random scale,
generates a set of initials uniformly distributed over a box region,
with some degree of irregularity or randomness.
|