Lemma 4.7, p. 132 — with ρ = 1, after a contraction there are never more than j* consecutive expansions
ProvedNelderMeadLD.Rate1D.lemma_4_7Let be strictly convex with bounded level sets, and apply the one-dimensional Nelder–Mead method with , , , to , starting from a nondegenerate ordered initial interval . Let and let be the largest integer with
(so when ). If iteration is a contraction, then at all later iterations there are no more than consecutive expansions: whenever and iterations are all expansions, .
Together with Lemma 4.6 this bounds the length of every move sequence between two contractions, which is what makes the diameter decrease at a uniform rate.
Formalization Note. is substituted; (2.1) is carried as a hypothesis. The two cases (a) and (b) of the page are encoded by one definition of as the largest in satisfying the strict inequality; in case (a) only satisfies it. The block of expansions may start at any , not only at .
import Mathlib import Definitions.Def_NelderMeadLD_Conv1D_Algorithm import Definitions.Def_NelderMeadLD_Rate1D_Algorithm
namespace NelderMeadLD.Rate1D
open NelderMeadLD.Conv1D
theorem lemma_4_7 (χ γ σ : ℝ) (hpar : ParamsOK 1 χ γ σ)
(f : ℝ → ℝ) (hf : StrictConvexOn ℝ Set.univ f)
(hlev : ∀ μ : ℝ, Bornology.IsBounded {x | f x ≤ μ})
(p0 : ℝ × ℝ) (h0 : IsStart f p0)
(k : ℕ) (hk : IsContraction (moveAt f χ γ σ p0 k)) :
∀ m : ℕ, k < m → ∀ L : ℕ,
(∀ i < L, moveAt f χ γ σ p0 (m + i) = Move.expand) → L ≤ jStar χ γ := by sorry
end NelderMeadLD.Rate1D
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.