Theorem 1 — the Bregman proximal point algorithm converges to a zero of a maximal monotone operator
ProvedBregmanPPA.EqMult.theorem1Let be a finite-dimensional real inner product space, a maximal monotone operator, and a Bregman function with zone such that . Let be positive scalars with , and let be an infinite sequence conforming to the recursion
Suppose that one of the following holds:
- (C1) ;
- (C2) for a proper lower semicontinuous convex function .
Then, if has a zero, converges to a zero of . If has no zero and (C1) holds, then is unbounded.
This is the central convergence theorem of the paper. In §4.1 it is applied to , the subdifferential of the negated dual functional of an equality-constrained convex program, for which (C2) holds.
Formalization Note The paper prints "maximal monontone operator of "; it means a maximal monotone operator on , here a finite-dimensional real inner product space . A run of (3) is encoded through the paper's equivalent form (4) together with . "Converges to one of them" is ; "unbounded" is "the range of is not bounded". is " for all ". This restates the goal of mission 1 of this series in this mission's namespace.
import Mathlib import Definitions.Def_ThreeOpSplitting_Convergence_MonotoneOperators import Definitions.Def_InertialFB_IFB_ConvexAnalysis import Definitions.Def_BregmanPPA_Convergence_Model open ThreeOpSplitting.Convergence InertialFB.IFB Filter Topology
namespace BregmanPPA.EqMult
theorem theorem1 {H : Type*} [NormedAddCommGroup H] [InnerProductSpace ℝ H]
[FiniteDimensional ℝ H]
(T : H → Set H) (S : Set H) (h : H → ℝ) (c : ℕ → ℝ) (x : ℕ → H)
(hT : IsMaximalMonotone T) (hh : BregmanPPA.Convergence.IsBregmanFunction S h) (hdom : dom T ⊆ closure S)
(hc : ∀ k, 0 < c k) (hcinf : ∃ ε > 0, ∀ k, ε ≤ c k)
(hx : BregmanPPA.Convergence.IsBregmanPPARun S h T c x)
(hC : closure (dom T) ⊆ S ∨
∃ f : H → EReal, IsProperFn f ∧ IsConvexFn f ∧ LowerSemicontinuous f ∧ T = BregmanPPA.Convergence.subdiffOp f) :
((zer T).Nonempty → ∃ z ∈ zer T, Tendsto x atTop (𝓝 z)) ∧
(zer T = ∅ → closure (dom T) ⊆ S → ¬ Bornology.IsBounded (Set.range x)) := by sorry
end BregmanPPA.EqMult
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.