Theorem 4 — Bregman proximal point sequences exist when im ∇h is everything, or is open and 0 ∈ im T
ProvedBregmanPPA.ProxMult.theorem4bregman-functionmaximal-monotonep2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1proximal-point
Let be a maximal monotone operator on a finite-dimensional real inner product space , and let be a Bregman function with zone . If either
- , or
- is open and ,
then for every sequence of positive scalars bounded away from zero and every , an infinite sequence starting at and conforming to the recursion (3) exists.
The proof of Theorem 8 applies case 1 on to obtain the existence clause.
Formalization Note Restated over a finite-dimensional inner product space (the paper's ). is the image and . The paper's recursion (3) does not fix ; the statement quantifies over every sequence bounded away from zero, as in the Section 2 setup of recursion (3).
Preamble
import Mathlib import Definitions.Def_BregmanPPA_Convergence_Model open ThreeOpSplitting.Convergence
Formal statement
namespace BregmanPPA.ProxMult
variable {H : Type*} [NormedAddCommGroup H] [InnerProductSpace ℝ H] [FiniteDimensional ℝ H]
/-- Theorem 4, p. 209, restated: `T` maximal monotone, `h` a Bregman function with zone
`S ⊇ dom T`. If `im ∇h = H`, or `im ∇h` is open and `0 ∈ im T`, then for all positive `c k` bounded away from zero
and every `x⁰ ∈ dom ∇h = S` an infinite sequence conforming to (3) and starting at `x⁰` exists. -/
theorem theorem4 (T : H → Set H) (S : Set H) (h : H → ℝ)
(hT : IsMaximalMonotone T) (hh : BregmanPPA.Convergence.IsBregmanFunction S h) (hdom : dom T ⊆ S)
(hcase : gradient h '' S = Set.univ ∨
(IsOpen (gradient h '' S) ∧ (0 : H) ∈ {y : H | ∃ z, y ∈ T z})) :
∀ c : ℕ → ℝ, (∀ k, 0 < c k) →
(∃ ε : ℝ, 0 < ε ∧ ∀ k, ε ≤ c k) → ∀ x₀ ∈ S,
∃ x : ℕ → H, x 0 = x₀ ∧ BregmanPPA.Convergence.IsBregmanPPARun S h T c x := by sorry
end BregmanPPA.ProxMult
Source
Eckstein, Nonlinear proximal point algorithms using Bregman functions, with applications to convex programming, Math. Oper. Res. 18(1) (1993), p. 209, Theorem 4
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.