Corollary 4.1, p. 131 — with ρ = 1, a contraction occurs no later than iteration K + r*, K the first bracketing index
ProvedNelderMeadLD.Rate1D.corollary_4_1Let 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 be the iteration index of Lemma 4.2, at which for the first time
where is the value at the best vertex of and the value at the expansion point . Then some iteration with , where , is a contraction (outside or inside).
The result locates the first contraction after the minimizer is bracketed; from that contraction on, the paper's move-sequence analysis applies.
Formalization Note. The printed corollary names only ; the conditions , (and ) are the section's standing assumptions (2.1) and are carried as hypotheses. is a binder together with the hypothesis that it is the first index with , as on the page.
import Mathlib import Definitions.Def_NelderMeadLD_Conv1D_Algorithm import Definitions.Def_NelderMeadLD_Rate1D_Algorithm
namespace NelderMeadLD.Rate1D
open NelderMeadLD.Conv1D
theorem corollary_4_1 (χ γ σ : ℝ) (hpar : ParamsOK 1 χ γ σ)
(f : ℝ → ℝ) (hf : StrictConvexOn ℝ Set.univ f)
(hlev : ∀ μ : ℝ, Bornology.IsBounded {x | f x ≤ μ})
(p0 : ℝ × ℝ) (h0 : IsStart f p0)
(K : ℕ) (hK : FirstBracket f χ γ σ p0 K) :
∃ k : ℕ, K ≤ k ∧ k ≤ K + rStar χ ∧ IsContraction (moveAt f χ γ σ p0 k) := by sorry
end NelderMeadLD.Rate1D
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.