Proof of Theorem 2.9, p. 9 — b_k ≥ 0 for L-Lipschitz B and λ ∈ (0, 1/(2L))
ProvedFRBSplitting.Linear.b_nonneglipschitzoperator-splittingp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1
Let be a real inner product space, -Lipschitz with , , any sequence in and any point. Then for every
Nonnegativity of is what allows the inequality to be iterated into a bound on alone.
Formalization Note. Indices are shifted by one (bSeq B lam x xs k is ). The paper states the bound for the iterates of the method and a zero ; it holds for every sequence and every point, and is stated so (a stronger statement). is pinned because the step range divides by .
Preamble
import Mathlib import Definitions.Def_ThreeOpSplitting_Accel_MonotoneOperators import Definitions.Def_FRBSplitting_Linear_Setting open InnerProductSpace ThreeOpSplitting.Accel
Formal statement
namespace FRBSplitting.Linear
theorem b_nonneg {H : Type*} [NormedAddCommGroup H] [InnerProductSpace ℝ H]
(B : H → H) (L lam : ℝ)
(hL : 0 < L) (hBL : IsLipschitzOp L B)
(hlam0 : 0 < lam) (hlam1 : lam < 1 / (2 * L))
(x : ℕ → H) (xs : H) :
∀ k : ℕ, 0 ≤ bSeq B lam x xs k := by sorry
end FRBSplitting.Linear
Source
Malitsky & Tam, A Forward-Backward Splitting Method for Monotone Inclusions Without Cocoercivity, arXiv:1808.04162v4, p. 9, definition of b_k and its lower bound, proof of Theorem 2.9
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.