Lemma 2.4, p. 3 — projecting along the ray from P_M x through x returns P_M x
ProvedProjReflGrad.Adaptive.lemma_2_4convex-analysishilbert-spacep2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1projection-method
Let be a real Hilbert space, nonempty, closed and convex, and . Then for every
The lemma is used in case (d) of the proof of Lemma 4.3, to rewrite as the projection of a point on the segment .
Preamble
import Mathlib import Definitions.Def_ProjReflGrad_Adaptive_Setting
Formal statement
namespace ProjReflGrad.Adaptive
/-- Lemma 2.4 (Malitsky 2015, p. 3): for `M` nonempty, closed and convex, `x ∈ H` and
`x̄ = P_M x`, one has `P_M(x̄ + λ(x - x̄)) = x̄` for every `λ > 0`. -/
theorem lemma_2_4 {H : Type*} [NormedAddCommGroup H] [InnerProductSpace ℝ H] [CompleteSpace H] (M : Set H) (hne : M.Nonempty)
(hcl : IsClosed M) (hcv : Convex ℝ M) (x : H) :
∀ l : ℝ, 0 < l → ProjReflGrad.Weak.proj M (ProjReflGrad.Weak.proj M x + l • (x - ProjReflGrad.Weak.proj M x)) = ProjReflGrad.Weak.proj M x := by sorry
end ProjReflGrad.Adaptive
Source
Malitsky, Projected Reflected Gradient Methods for Monotone Variational Inequalities, arXiv:1502.04968v1, p. 3, Lemma 2.4
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.