Skip to main content
Ctrl+K
Paref - Home
  • basics
  • faq
  • trouble-shooting
  • algorithms
  • demo
    • api-reference
    • sequences
    • reflections
    • theory
  • GitHub
  • basics
  • faq
  • trouble-shooting
  • algorithms
  • demo
  • api-reference
  • sequences
  • reflections
  • theory
  • GitHub
  • API Reference
  • paref.pareto_reflection_sequences.multi_dimensional
  • paref.pareto...

paref.pareto_reflection_sequences.multi_dimensional.grid_search#

Classes

GridSearch(**kwargs)

Determine an equidistant grid of Pareto points

class paref.pareto_reflection_sequences.multi_dimensional.grid_search.GridSearch(**kwargs)[source]#

Bases: SequenceParetoReflections

Determine 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

previous

paref.pareto_reflection_sequences.multi_dimensional.find_edge_points_sequence

next

paref.pareto_reflection_sequences.two_dimensional

On this page
  • GridSearch
    • GridSearch.next()
Show Source

© Copyright 2023, Nicolai Palm.

Created using Sphinx 7.4.7.

Built with the PyData Sphinx Theme 0.15.4.