Corollary 3.1, p. 122 — if the best vertex changes infinitely often, all limiting vertex values coincide
ProvedNelderMeadLD.Dim2.corollary_3_1convergencenelder-meadp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1
Let () be bounded below, let the coefficients satisfy (2.1), and let be a run of Algorithm NM on from a nondegenerate initial simplex in which no shrink step occurs. If the best vertex changes infinitely often, i.e. for infinitely many , then there is a single number with
that is, .
This corollary of broken convergence settles the case of Theorem 5.1 in which the best vertex keeps moving.
Formalization Note "The change index is 1 infinitely often" is written as: for every there is with (index 0 in Lean). The conclusion asserts the existence of the common limit.
Preamble
import Mathlib import Definitions.Def_NelderMeadLD_Dim2_Algorithm open Filter Topology
Formal statement
namespace NelderMeadLD.Dim2
theorem corollary_3_1 {n : ℕ} [NeZero n] (f : E n → ℝ) (ρ χ γ σ : ℝ) (hpar : NelderMeadLD.Conv1D.ParamsOK ρ χ γ σ)
(Δ : ℕ → Fin (n + 1) → E n) (hrun : IsNMRun f ρ χ γ σ Δ) (hnd : Nondegenerate (Δ 0))
(hbdd : BddBelow (Set.range f)) (hnoshrink : ∀ k, ¬ IsShrinkAt f ρ χ γ Δ k)
(hinf : ∀ N : ℕ, ∃ k ≥ N, Δ (k + 1) 0 ≠ Δ k 0) :
∃ L : ℝ, ∀ i, Tendsto (fun k => f (Δ k i)) atTop (𝓝 L) := by sorry
end NelderMeadLD.Dim2
Source
Lagarias, Reeds, Wright & Wright, Convergence properties of the Nelder–Mead simplex method in low dimensions, SIAM J. Optim. 9 (1998), p. 122, Corollary 3.1
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.