Proof of Theorem 6 — the multipliers of (9) are a Bregman proximal point run on
ProvedBregmanPPA.EqMult.theorem6_ppa_runConsider problem (7) under its standing assumptions: closed and convex, convex and lower semicontinuous, , and the dual functional not identically . Let be a Bregman function with zone and , let , and let conform to recursion (9),
Then the multiplier sequence conforms to the Bregman proximal point recursion for :
that is, for every .
This identity reduces the convergence of the nonquadratic method of multipliers to Theorem 1 applied to the maximal monotone operator .
Formalization Note The recursion is encoded in form (4), as in the definition of runs; the zone is all of , so the condition is automatic. is the subdifferential of the EReal function . is surjectivity of . The paper states this claim in the proof of Theorem 6, under the standing assumptions of §4.1, which are all hypotheses here.
import Mathlib import Definitions.Def_InertialFB_IFB_ConvexAnalysis import Definitions.Def_fenchelConjugate import Definitions.Def_BregmanPPA_Convergence_Model import Definitions.Def_BregmanPPA_EqMult_EqConstrainedProgram open InertialFB.IFB ConvexOptimization Filter Topology
namespace BregmanPPA.EqMult
theorem theorem6_ppa_run {n m : ℕ}
(A : EuclideanSpace ℝ (Fin n) →L[ℝ] EuclideanSpace ℝ (Fin m))
(b : EuclideanSpace ℝ (Fin m)) (X : Set (EuclideanSpace ℝ (Fin n)))
(f : EuclideanSpace ℝ (Fin n) → EReal)
(hP : IsEqProgram X f) (hd : ∃ p, dualEq A b X f p ≠ ⊥)
(h : EuclideanSpace ℝ (Fin m) → ℝ) (hh : BregmanPPA.Convergence.IsBregmanFunction Set.univ h)
(him : Function.Surjective (gradient h))
(c : ℕ → ℝ) (hc : ∀ k, 0 < c k)
(x : ℕ → EuclideanSpace ℝ (Fin n)) (p : ℕ → EuclideanSpace ℝ (Fin m))
(hrun : IsEqMultRun A b X f h c x p) :
BregmanPPA.Convergence.IsBregmanPPARun Set.univ h (BregmanPPA.Convergence.subdiffOp (negDual A b X f)) c p := by sorry
end BregmanPPA.EqMult
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.