(4.9), proof of Theorem 4.1, p. 130 — proximity (4.4) implies |x_min − x₁| ≤ N_NM diam(Δ)
ProvedNelderMeadLD.Conv1D.eq_4_9convergencenelder-meadp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1
Let the parameters satisfy (2.1), let be the constant (4.3), and let be a real number. For every pair of reals satisfying the proximity property (4.4),
one has
In the proof of Theorem 4.1 this converts the proximity property, which holds from the bracketing iteration on, into a distance bound that tends to zero with the diameter.
Formalization Note The statement is about an arbitrary pair; along a run it gives (4.9) at every iteration where (4.4) holds. The proof's display writes the interval with a closing ")", (4.4) with "]"; the closed end, as in (4.4), is used.
Preamble
import Mathlib import Definitions.Def_NelderMeadLD_Conv1D_Algorithm open Filter Topology
Formal statement
namespace NelderMeadLD.Conv1D
theorem eq_4_9 (ρ χ γ σ : ℝ) (hpar : ParamsOK ρ χ γ σ) (xmin : ℝ) :
∀ p : ℝ × ℝ, Proximity ρ χ γ xmin p → |xmin - p.1| ≤ NNM ρ χ γ * diam p := 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. 130, proof of Theorem 4.1, (4.9)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.