§5, p. 14 — for all
ProvedSlowConvergence.ARC.phi_memlower-boundp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1worst-case-complexity
Let , , and
Then for every .
This bounds the coefficients (5.11) of the Hermite pieces uniformly in .
Preamble
import Mathlib import Definitions.Def_SlowConvergence_ARC_Data import Definitions.Def_SlowConvergence_ARC_Pieces
Formal statement
namespace SlowConvergence.ARC
/-- Cartis, Gould & Toint, preprint 15 Oct 2009, §5, p. 14: "The definition of φ_k implies that
φ_k ∈ (0, 1) for all k ≥ 0", where `φ_k = (k+1)^µ[(1/(k+1))^µ − (1/(k+2))^µ]` and `µ = 2/3 + 2η`. -/
theorem phi_mem (τ : ℝ) (hτ0 : 0 < τ) (hτ1 : τ < 1) (k : ℕ) :
0 < phi τ k ∧ phi τ k < 1 := by sorry
end SlowConvergence.ARC
Source
Cartis, Gould & Toint, On the complexity of steepest descent, Newton's and regularized Newton's methods, preprint 15 Oct 2009, p. 14, §5, after (5.11)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.