paref.pareto_reflection_sequences.multi_dimensional.grid_search#
Classes
|
Determine an equidistant grid of Pareto points |
- class paref.pareto_reflection_sequences.multi_dimensional.grid_search.GridSearch(**kwargs)[source]#
Bases:
SequenceParetoReflectionsDetermine an equidistant grid of Pareto points
When to use#
Use this sequence when you want to determine an equidistant grid of Pareto points, for example when you want to get a solid approximation of the Pareto front taking into account based on the maximum number of evaluations you granted.
Note
This sequence should be used at the beginning of the optimization process, i.e. before other Pareto reflection are applied. This is because the sequence does not take into account the Pareto front of the evaluations and might, therefore, return points that are already closet to or in the Pareto front.
What it does#
This sequence determines an equidistant grid of Pareto points including edge points for all dimensions.
Examples
# TBA: add
Initialize storage for Pareto reflections
- next(**kwargs)#
Store Pareto reflections