Lemma 3.2 — Powell-regularized updates keep
ProvedAndersonAccel.Safe.abs_det_geanderson-accelerationdeterminantp2o-batch-p200ap2o-gran-per-chapterp2o-plan-paperp2o-v1rank-one-update
Let , let and be arbitrary vectors in , and let be the Powell-regularized rank-one matrices of (3.5), with the orthogonalization (3.2) and as in (3.3). Suppose every update is well-defined, i.e. for . Then
and in particular is invertible.
This is the nonsingularity result for the modified quasi-Newton matrices; it shows how the parameter trades stability against the size of each update.
Formalization Note is LinearMap.det of the continuous linear map; invertibility is IsUnit in the ring of continuous linear maps. The window is re-indexed to start at (the paper's ).
Preamble
import Mathlib import Definitions.Def_AndersonAccel_Safe_Basic import Definitions.Def_AndersonAccel_Safe_windowB
Formal statement
namespace AndersonAccel.Safe
/-- Lemma 3.2 (p. 3176). If every update of (3.5) is well-defined (`ŝ_iᵀ s_i ≠ 0`), then
`|det B| ≥ θ̄^{m_k} > 0` and `B` is invertible. -/
theorem abs_det_ge {n : ℕ} (θbar : ℝ) (hθ0 : 0 < θbar) (hθ1 : θbar < 1)
(s y : ℕ → EuclideanSpace ℝ (Fin n)) (mk : ℕ)
(hwd : ∀ i < mk, inner ℝ (windowShat s i) (s i) ≠ 0) :
θbar ^ mk ≤ |LinearMap.det (windowB θbar s y mk :
EuclideanSpace ℝ (Fin n) →ₗ[ℝ] EuclideanSpace ℝ (Fin n))| ∧
0 < θbar ^ mk ∧ IsUnit (windowB θbar s y mk) := by sorry
end AndersonAccel.Safe
Source
Zhang, O'Donoghue, Boyd, SIAM J. Optim. 30 (2020), p. 3176, Lemma 3.2
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.