Corollary 3.4 — (3.8)
ProvedAndersonAccel.Safe.norm_inverse_windowB_leanderson-accelerationmatrix-inverseoperator-normp2o-batch-p200ap2o-gran-per-chapterp2o-plan-paperp2o-v1
Under the assumptions of Lemma 3.3 (, max-memory , , well-defined updates, and on the window), the inverse of the Powell-regularized matrix satisfies
This is the uniform bound on the approximate inverse Jacobians that the global convergence proof needs for every accelerated step.
Formalization Note is Ring.inverse of the window matrix, which is its true inverse by Lemma 3.2. is the dimension; for the natural-number subtraction gives , which is harmless since then .
Preamble
import Mathlib import Definitions.Def_AndersonAccel_Safe_Basic import Definitions.Def_AndersonAccel_Safe_windowB
Formal statement
namespace AndersonAccel.Safe
/-- Corollary 3.4, Eq. (3.8) (p. 3178). Under the hypotheses of Lemma 3.3,
`‖H‖ = ‖B⁻¹‖ ≤ (3((1 + θ̄ + τ)/τ)^m - 2)^{n-1} / θ̄^m`. -/
theorem norm_inverse_windowB_le {n : ℕ} (θbar τ : ℝ) (m : ℕ) (hθ0 : 0 < θbar) (hθ1 : θbar < 1)
(hτ0 : 0 < τ) (hτ1 : τ < 1) (hm : 1 ≤ m)
(s y : ℕ → EuclideanSpace ℝ (Fin n)) (mk : ℕ) (hmk : mk ≤ m)
(hwd : ∀ i < mk, inner ℝ (windowShat s i) (s i) ≠ 0)
(hy : ∀ i < mk, ‖y i‖ ≤ 2 * ‖s i‖)
(hτs : ∀ i < mk, τ * ‖s i‖ ≤ ‖windowShat s i‖) :
‖Ring.inverse (windowB θbar s y mk)‖ ≤
(3 * ((1 + θbar + τ) / τ) ^ m - 2) ^ (n - 1) / θbar ^ m := by sorry
end AndersonAccel.Safe
Source
Zhang, O'Donoghue, Boyd, SIAM J. Optim. 30 (2020), p. 3178, Corollary 3.4, Eq. (3.8)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.