Documentation

IntroductoryLecturesOnConvexOptimization_Nesterov_2004.Chap01.Definition_1_2_4

structure BlackBoxOptimizationProblemClass (Query : Type v) (Answer : Type w) (State : Type x) :
Type (max (max (max (u + 1) v) w) x)

Definition 1.2.4: a black-box optimization problem class is the triple 𝒫 ≡ (Σ, 𝒪, 𝒯_ε), where Σ is a model of problems, 𝒪 is the class oracle, and 𝒯_ε is the chosen stopping criterion. The accuracy threshold is already part of the source-facing stopping criterion 𝒯_ε, so it is not stored as separate primitive data in the owner.

  • model : Type u

    The model Σ of optimization problems.

  • oracle : self.modelQueryAnswer

    The class oracle 𝒪, as a model-indexed family of fixed-problem oracles.

  • stoppingCriterion : Set State

    The fixed ε-stopping criterion 𝒯_ε, in the canonical owner form Set State.

Instances For