Theorem 4.1 — the accelerated proximal point method has fixed-point residual
ProvedAccelPPM.FPR.theorem4_1_fixed_point_residualLet be a real Hilbert space, let be a maximally monotone operator, let , and let be generated by the proposed accelerated proximal point method
Assume for a constant and some . Then for every ,
Here is the fixed-point residual of the resolvent at . The rate improves the rate of the plain proximal point method, and it holds in every real Hilbert space, for every step size and every maximally monotone operator.
Formalization Note The step size is written lam. The resolvent step is encoded relationally as , i.e. ; for monotone and the resolvent is single-valued, so the inclusion determines , and for maximally monotone it is defined everywhere (Minty), so runs exist from every start. The sequences are indexed by ℕ; is y (0 - 1) = y 0 by natural-number subtraction. is cast to in .
import Mathlib import Definitions.Def_AccelPPM_FPR_IsMaximalMonotone import Definitions.Def_AccelPPM_FPR_IsAccelPPMSeq
namespace AccelPPM.FPR
/-- **Theorem 4.1** (Kim, arXiv:1905.05149v4, p. 10). Let `M` be a maximally monotone operator on
a real Hilbert space `H`, let `λ > 0`, and let `x₀, y₀, x₁, y₁, … ∈ H` be generated by the proposed
accelerated proximal point method. Assume `‖x₀ − x_*‖ ≤ R` for a constant `R > 0` and some
`x_* ∈ X_*(M)`. Then for every `i ≥ 1`,
`‖x_i − y_{i−1}‖² ≤ R² / i²`. -/
theorem theorem4_1_fixed_point_residual {H : Type*} [NormedAddCommGroup H]
[InnerProductSpace ℝ H] [CompleteSpace H]
(M : H → Set H) (hM : IsMaximalMonotone M) (lam : ℝ) (hlam : 0 < lam)
(x y : ℕ → H) (hseq : IsAccelPPMSeq M lam x y)
(xstar : H) (hxstar : xstar ∈ zeroSet M) (R : ℝ) (hR : 0 < R)
(hx0 : ‖x 0 - xstar‖ ≤ R) :
∀ i : ℕ, 1 ≤ i → ‖x i - y (i - 1)‖ ^ 2 ≤ R ^ 2 / (i : ℝ) ^ 2 := by sorry
end AccelPPM.FPR
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.