Documentation

LeanPool.LongTails.Setups.GeneralizedSmoothAndConvex

Adapted from k3nfalt/longtails, commit 269cbc764dd36851fd0b64f2f950f329ee127de4. Modified for Lean Pool: module visibility, namespace isolation, and current Mathlib.

Problem information available to the method, excluding its target accuracy.

  • E : Type u

    Real Hilbert space in which optimization takes place.

  • normedE : NormedAddCommGroup self.E

    Normed additive structure of the optimization space.

  • linearE : InnerProductSpace ℝ self.E

    Real inner product defining gradients.

  • completeE : CompleteSpace self.E

    Completeness of the optimization space.

  • L0 : ℝ

    Constant part of the Hessian-growth bound.

  • L1 : ℝ

    Coefficient of gradient norm in the Hessian-growth bound.

  • R : ℝ

    Bound on initial distance to an attained minimizer.

  • Δ : ℝ

    Bound on the initial objective gap.

  • x0 : self.E

    Initial point of the algorithm.

Instances For

    Public problem information together with the parameters of the accuracy guarantee.

    Instances For
      @[reducible, inline]

      Convex optimization with exact gradients and the displayed regularity assumptions.

      Equations
      • One or more equations did not get rendered due to their size.
      Instances For