Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 7 proof — multiplier recursion is a Bregman proximal step

Proved
BregmanPPA.IneqMult.proximal_identity

by mikedeng1 · Oct 6, 2026 · Mathlib 0df444a (Lean v4.33.1)

multiplier-methodp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1proximal-point

Under the standing conditions for problem (10), the Bregman function and the positive step sizes, every sequence satisfying recursion (11) is a Bregman proximal-point run for the subdifferential of the negative dual functional:

ck−1(∇h(pk)−∇h(pk+1))∈∂(−d)(pk+1)(k≥0).c_k^{-1}(\nabla h(p^k)-\nabla h(p^{k+1}))\in\partial(-d)(p^{k+1})\qquad(k\ge0).ck−1​(∇h(pk)−∇h(pk+1))∈∂(−d)(pk+1)(k≥0).

This identifies the operator to which Theorem 1 applies.

Formalization Note The multiplier sequence is explicitly kept inside SSS. The dual functional is extended-real valued; the run's monotone conjugate uses real values justified by Lemma 3.

Preamble
import Mathlib
import Definitions.Def_BregmanPPA_IneqMult_Run

open Filter Topology
Formal statement
namespace BregmanPPA.IneqMult

/-- The last displayed equivalence in the proof of Theorem 7, p. 217: (11) is a
Bregman proximal point run for the subdifferential of the negative dual functional. -/
theorem proximal_identity {n m : ℕ} (C : Set (E n)) (f : E n → EReal)
    (g : Fin m → E n → EReal) (S : Set (E m)) (h : E m → ℝ)
    (c : ℕ → ℝ) (x : ℕ → E n) (p : ℕ → E m)
    (hP : IsConvexProgram C f g)
    (hd : ∃ q : E m, dualFn C f g q ≠ ⊥)
    (hh : BregmanPPA.Convergence.IsBregmanFunction S h)
    (hS : posOrthant m ⊆ S)
    (him : posOrthant m ⊆ gradient h '' S)
    (hc : ∀ k, 0 < c k)
    (hrun : IsIneqMultiplierRun C f g S h c x p) :
    BregmanPPA.Convergence.IsBregmanPPARun S h (BregmanPPA.Convergence.subdiffOp (fun q => -(dualFn C f g q))) c p := 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), p. 217, proof of Theorem 7, final displayed equivalence, https://doi.org/10.1287/moor.18.1.202
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 6, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me