§2.3, (7) — Fejér inequality: ‖xⁿ⁺¹ − x̄‖² ≤ ‖xⁿ − x̄‖² − ‖xⁿ⁺¹ − xⁿ‖² for x̄ ∈ M
ProvedMartinetReg.VI.eq7fejer-monotonehilbert-spacep2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1proximal-pointvariational-inequality
Let be a real Hilbert space, convex, closed and bounded, monotone and hemicontinuous on , and let be a sequence generated by the regularization algorithm (2) from . Let be any solution of (1) and set . Then for every
Consequently the distances to every solution are nonincreasing (Fejér monotonicity), which drives Lemme 1.
Formalization Note. is a hypothesis, as in the paper ("Soit quelconque"). The standing hypotheses of §2.1 are bundled in Standing T C, and IsRegSeq T C x says and every step satisfies (2).
Preamble
import Mathlib import Definitions.Def_MartinetReg_VI_Setting
Formal statement
namespace MartinetReg.VI
open Filter Topology
/-- §2.3, (7), p. 156: with `dⁿ = ‖xⁿ − x̄‖²` for a solution `x̄ ∈ M`,
`dⁿ⁺¹ ≤ dⁿ − ‖xⁿ⁺¹ − xⁿ‖²`. -/
theorem eq7 {H : Type*} [NormedAddCommGroup H] [InnerProductSpace ℝ H] [CompleteSpace H]
(T : H → StrongDual ℝ H) (C : Set H) (hS : Standing T C)
(x : ℕ → H) (hx : IsRegSeq T C x) (xbar : H) (hxbar : xbar ∈ solSet T C) (n : ℕ) :
‖x (n + 1) - xbar‖ ^ 2 ≤ ‖x n - xbar‖ ^ 2 - ‖x (n + 1) - x n‖ ^ 2 := by sorry
end MartinetReg.VI
Source
Martinet, Régularisation d'inéquations variationnelles par approximations successives, R.I.R.O. 4(R-3) (1970), p. 156, §2.3, (7) (dⁿ defined on p. 155)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.