Lemma 2.7, p. 3 — nonnegative forces bounded and
ProvedProjReflGrad.Weak.lemma_2_7convergencep2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1real-sequences
Let and be two nonnegative real sequences such that
Then is bounded and .
This elementary lemma turns the descent inequality (3.6) into boundedness of the iterates and vanishing of the steps.
Preamble
import Mathlib import Definitions.Def_ProjReflGrad_Weak_Setting
Formal statement
namespace ProjReflGrad.Weak
/-- Lemma 2.7 (Malitsky 2015, p. 3): if `(a_n)`, `(b_n)` are nonnegative real sequences with
`a_{n+1} ≤ a_n - b_n`, then `(a_n)` is bounded and `b_n → 0`. -/
theorem lemma_2_7 (a b : ℕ → ℝ) (ha : ∀ n, 0 ≤ a n) (hb : ∀ n, 0 ≤ b n)
(hab : ∀ n, a (n + 1) ≤ a n - b n) :
Bornology.IsBounded (Set.range a) ∧ Filter.Tendsto b Filter.atTop (nhds 0) := by sorry
end ProjReflGrad.Weak
Source
Malitsky, Projected Reflected Gradient Methods for Monotone Variational Inequalities, arXiv:1502.04968v1, p. 3, Lemma 2.7
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.