Theorem 8 — the proximal-type algorithm (3.1) converges strongly to Q_{T⁻¹0} x_0
ProvedProximalBanach.Hybrid.hybrid_proximal_strong_convergenceLet be a uniformly convex and uniformly smooth real Banach space with duality mapping , and let be a maximal monotone operator with . Let satisfy . Let be generated by the algorithm
Then converges strongly to , the generalized projection of onto the zero set of :
This extends Solodov and Svaiter's strongly convergent hybrid proximal point method from Hilbert spaces to spaces such as , .
Formalization Note The conclusion is that there is a point which is a generalized projection of onto ( minimizes there) and in norm. is encoded as "there is with for all large ". The theorem holds for every run of (3.1) (runs exist by Proposition 7). Reflexivity, strict convexity and smoothness are not assumed: they follow from uniform convexity and uniform smoothness. is not assumed closed or convex.
import Mathlib import Definitions.Def_ProximalBanach_Hybrid_Basic
namespace ProximalBanach.Hybrid
open Filter Topology
variable {E : Type*} [NormedAddCommGroup E] [NormedSpace ℝ E] [CompleteSpace E]
/-- Theorem 8 (p. 942): let `E` be uniformly convex and uniformly smooth and `T` maximal
monotone with `T⁻¹0 ≠ ∅`. If `r_n > 0` and `liminf r_n > 0`, then every run `{x_n}` of (3.1)
converges strongly to `Q_{T⁻¹0} x_0`. -/
theorem hybrid_proximal_strong_convergence [UniformConvexSpace E]
(hUS : IsUniformlySmooth E) (J : E → StrongDual ℝ E) (hJ : ∀ x, J x ∈ dualityMap x)
(T : E → Set (StrongDual ℝ E)) (hT : IsMaximalMonotone T) (hZ : (zeros T).Nonempty)
(r : ℕ → ℝ) (hr : ∀ n, 0 < r n) (hlim : ∃ c : ℝ, 0 < c ∧ ∀ᶠ n in atTop, c ≤ r n)
(x y : ℕ → E) (v : ℕ → StrongDual ℝ E) (hrun : IsHybridRun T J r x y v) :
∃ z : E, IsGenProj J (zeros T) (x 0) z ∧ Tendsto x atTop (𝓝 z) := by sorry
end ProximalBanach.Hybrid
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.