Lemma 4.5, p. 129 — the diameter of the 1-D Nelder–Mead interval tends to 0
ProvedNelderMeadLD.Conv1D.lemma_4_5convergencenelder-meadp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1strict-convexity
Let be strictly convex with bounded level sets and minimizer . Let the parameters satisfy (2.1) (in particular and ), and let be the one-dimensional Nelder–Mead run from a nondegenerate, ordered initial interval . Then
The interval always collapses to a point, whatever the value of ; whether that point is the minimizer is the subject of Theorem 4.1.
Formalization Note No condition on is assumed. As in Lemma 4.4, , and come from the standing conditions (2.1).
Preamble
import Mathlib import Definitions.Def_NelderMeadLD_Conv1D_Algorithm open Filter Topology
Formal statement
namespace NelderMeadLD.Conv1D
theorem lemma_4_5 (f : ℝ → ℝ) (hf : StrictConvexOn ℝ Set.univ f)
(hlev : ∀ μ : ℝ, Bornology.IsBounded {x | f x ≤ μ})
(xmin : ℝ) (hmin : ∀ y, f xmin ≤ f y)
(ρ χ γ σ : ℝ) (hpar : ParamsOK ρ χ γ σ)
(p0 : ℝ × ℝ) (h0 : IsStart f p0) :
Tendsto (fun k => diam (run f ρ χ γ σ p0 k)) atTop (𝓝 0) := by sorry
end NelderMeadLD.Conv1D
Source
Lagarias, Reeds, Wright & Wright, Convergence properties of the Nelder–Mead simplex method in low dimensions, SIAM J. Optim. 9 (1998), p. 129, Lemma 4.5
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.