Proof of Theorem 8, p. 221 — h_x ⊕ h_p is a Bregman function with zone S_x × S_p ⊇ C × Ω̄⁺ ⊇ cl dom K
ProvedBregmanPPA.ProxMult.sum_bregmanbregman-functionp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1saddle-point
For a problem of the form (10), let be a Bregman function on with zone and a Bregman function on with zone . Then , , is a Bregman function on with zone , and
Together these give the hypotheses and (C1) under which Theorem 1 is applied to .
Formalization Note is WithLp 2 (E n × E m), where . The paper's chain also passes through ; the statement keeps its two ends, the zone and . The paper asserts the Bregman property without proof ("Then is a Bregman function").
Preamble
import Mathlib import Definitions.Def_BregmanPPA_Convergence_Model import Definitions.Def_BregmanPPA_IneqMult_Program import Definitions.Def_BregmanPPA_ProxMult_Saddle open ThreeOpSplitting.Convergence
Formal statement
namespace BregmanPPA.ProxMult
/-- Proof of Theorem 8, p. 221: `h = h_x ⊕ h_p` is a Bregman function on `ℝⁿ⁺ᵐ` with zone
`S_x × S_p`, and `S_x × S_p ⊇ C × Ω̄⁺ ⊇ cl dom K`. -/
theorem sum_bregman {n m : ℕ} (C : Set (BregmanPPA.IneqMult.E n)) (f : BregmanPPA.IneqMult.E n → EReal) (g : Fin m → BregmanPPA.IneqMult.E n → EReal)
(Sx : Set (BregmanPPA.IneqMult.E n)) (hx : BregmanPPA.IneqMult.E n → ℝ) (Sp : Set (BregmanPPA.IneqMult.E m)) (hp : BregmanPPA.IneqMult.E m → ℝ)
(hP : BregmanPPA.IneqMult.IsConvexProgram C f g)
(hhx : BregmanPPA.Convergence.IsBregmanFunction Sx hx) (hSx : C ⊆ Sx)
(hhp : BregmanPPA.Convergence.IsBregmanFunction Sp hp) (hSp : BregmanPPA.IneqMult.nonnegOrthant m ⊆ Sp) :
BregmanPPA.Convergence.IsBregmanFunction (prodZone Sx Sp) (sumFn hx hp) ∧
closure (dom (opK C f g)) ⊆ prodZone Sx Sp := 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. 221, proof of Theorem 8 (h = h_x ⊕ h_p)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.