Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 7 — convergence of nonquadratic inequality multipliers

Proved
BregmanPPA.IneqMult.theorem7

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

bregman-functionconvex-programmingmultiplier-methodp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Consider problem (10) with closed nonempty convex CCC, proper lower semicontinuous convex f,g1,…,gmf,g_1,\ldots,g_mf,g1​,…,gm​ finite on CCC, and a dual functional not identically −∞-\infty−∞. Let hhh be a Bregman function whose zone and gradient image contain the strictly positive orthant. Let (ck)(c_k)(ck​) be positive with a positive lower bound, and let (xk,pk)(x^k,p^k)(xk,pk) satisfy recursion (11). Then:

∃p∗∈argmax⁡d⟹pk→some optimal p∗,∃p∗∈argmax⁡d,gi continuous on C,Ω+‾⊆S⟹every primal limit point solves (10),argmax⁡d=∅,Ω+‾⊆S⟹{pk} is unbounded.\begin{aligned} \exists p^*\in\operatorname*{argmax}d&\Longrightarrow p^k\to\text{some optimal }p^*,\\ \exists p^*\in\operatorname*{argmax}d,\quad g_i\text{ continuous on }C,\quad\overline{\Omega^+}\subseteq S&\Longrightarrow\text{every primal limit point solves (10)},\\ \operatorname*{argmax}d=\varnothing,\quad\overline{\Omega^+}\subseteq S&\Longrightarrow\{p^k\}\text{ is unbounded}. \end{aligned}∃p∗∈argmaxd∃p∗∈argmaxd,gi​ continuous on C,Ω+⊆Sargmaxd=∅,Ω+⊆S​⟹pk→some optimal p∗,⟹every primal limit point solves (10),⟹{pk} is unbounded.​

This is the paper's convergence and divergence result for a nonquadratic method of multipliers with inequality constraints.

Formalization Note The paper prints “if (10) has no solution” in the last clause; its proof on p. 218 establishes the no-optimal-multiplier premise, and that is the statement formalized. The second clause is the paper's “convergent case” and thus explicitly assumes an optimal multiplier. The closed-orthant zone condition applies only to the last two clauses. A limit point is a subsequential limit, and unboundedness concerns the range of the full multiplier sequence.

Preamble
import Mathlib
import Definitions.Def_BregmanPPA_IneqMult_Run

open Filter Topology
Formal statement
namespace BregmanPPA.IneqMult

/-- Theorem 7, p. 216, with its final condition corrected to the condition proved on p. 218. -/
theorem theorem7 {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)
    (hcinf : ∃ ε : ℝ, 0 < ε ∧ ∀ k, ε ≤ c k)
    (hrun : IsIneqMultiplierRun C f g S h c x p) :
    ((∃ q : E m, IsOptimalMultiplier C f g q) →
      ∃ pstar : E m, IsOptimalMultiplier C f g pstar ∧ Tendsto p atTop (𝓝 pstar)) ∧
    ((∃ q : E m, IsOptimalMultiplier C f g q) →
      (∀ i, ContinuousOn (g i) C) → nonnegOrthant m ⊆ S →
      ∀ (φ : ℕ → ℕ) (xstar : E n), StrictMono φ →
        Tendsto (x ∘ φ) atTop (𝓝 xstar) → IsSolution C f g xstar) ∧
    ((¬ ∃ q : E m, IsOptimalMultiplier C f g q) →
      nonnegOrthant m ⊆ S → ¬ Bornology.IsBounded (Set.range 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), pp. 216–218, Theorem 7 and proof, 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