Theorem 1 — convergence or unboundedness of a Bregman proximal-point run
ProvedBregmanPPA.IneqMult.theorem1bregman-functionmonotone-operatorp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1proximal-point
Let be maximal monotone on a finite-dimensional real inner-product space, let be a Bregman function with zone such that , and let obey the Bregman proximal-point recursion with positive step sizes bounded below by a positive constant. Suppose either (C1) , or (C2) for a proper lower semicontinuous convex function . Then
This theorem supplies the convergence alternative used for the negative dual subdifferential in Theorem 7.
Formalization Note The standing inclusion is distinct from condition (C1). The run is equation (4), equivalent to (3), and explicitly keeps iterates in .
Preamble
import Mathlib import Definitions.Def_BregmanPPA_Convergence_Model open Filter Topology ThreeOpSplitting.Convergence InertialFB.IFB
Formal statement
namespace BregmanPPA.IneqMult
variable {H : Type*} [NormedAddCommGroup H] [InnerProductSpace ℝ H] [FiniteDimensional ℝ H]
/-- Theorem 1, pp. 206–207, restated for use with the inequality dual operator. -/
theorem theorem1 (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 : H, z ∈ zer T ∧ Tendsto x atTop (𝓝 z)) ∧
(zer T = ∅ → closure (dom T) ⊆ S → ¬ Bornology.IsBounded (Set.range x)) := by sorry
end BregmanPPA.IneqMult
Source
Eckstein, Nonlinear proximal point algorithms using Bregman functions, with applications to convex programming, Math. Oper. Res. 18(1) (1993), pp. 206–207, Theorem 1, https://doi.org/10.1287/moor.18.1.202
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.