Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Eq. (20): one-step estimate of the augmented Lagrangian along the proximal ADMM

Proved
NonconvexSplitting.ADMMBounded.eq20_one_step

by mikedeng1 · Sep 29, 2026 · Mathlib 0df444a (Lean v4.33.1)

admmnonconvex-optimizationp2o-batch-p200bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Let h:Rn→Rh : \mathbb{R}^n \to \mathbb{R}h:Rn→R be twice continuously differentiable with bounded Hessian, P:Rm→(−∞,+∞]P : \mathbb{R}^m \to (-\infty, +\infty]P:Rm→(−∞,+∞] proper and lower semicontinuous, ϕ:Rn→R\phi : \mathbb{R}^n \to \mathbb{R}ϕ:Rn→R twice continuously differentiable and convex, M:Rn→Rm\mathcal M : \mathbb{R}^n \to \mathbb{R}^mM:Rn→Rm linear with adjoint M∗\mathcal M^*M∗, and β>0\beta > 0β>0. Let (xt,yt,zt)t≥0(x^t, y^t, z^t)_{t \ge 0}(xt,yt,zt)t≥0​ be a sequence generated by the proximal ADMM with penalty β\betaβ and proximal function ϕ\phiϕ (initial points x0,z0x^0, z^0x0,z0 arbitrary, y0y^0y0 unconstrained). Suppose Assumption 1 holds with witnesses σ,δ,γ\sigma, \delta, \gammaσ,δ,γ and Q1,Q2,T1,T2,Q3\mathcal Q_1, \mathcal Q_2, \mathcal T_1, \mathcal T_2, \mathcal Q_3Q1​,Q2​,T1​,T2​,Q3​. For a self-map T\mathcal TT write ∥x∥T2:=⟨x,Tx⟩\|x\|^2_{\mathcal T} := \langle x, \mathcal T x\rangle∥x∥T2​:=⟨x,Tx⟩.

Then for every t≥1t \ge 1t≥1,

Lβ(xt+1,yt+1,zt+1)≤Lβ(xt,yt,zt)+12∥xt+1−xt∥2σβγQ3−δI−T22+12∥xt−xt−1∥2σβ(1−γ)T122.L_\beta(x^{t+1}, y^{t+1}, z^{t+1}) \le L_\beta(x^t, y^t, z^t) + \frac12\|x^{t+1} - x^t\|^2_{\frac{2}{\sigma\beta\gamma}\mathcal Q_3 - \delta\mathcal I - \mathcal T_2} + \frac12\|x^t - x^{t-1}\|^2_{\frac{2}{\sigma\beta(1-\gamma)}\mathcal T_1^2}.Lβ​(xt+1,yt+1,zt+1)≤Lβ​(xt,yt,zt)+21​∥xt+1−xt∥σβγ2​Q3​−δI−T2​2​+21​∥xt−xt−1∥σβ(1−γ)2​T12​2​.

This is the basic descent estimate of the proximal ADMM; summed along the iterations it gives the monotonicity of the merit sequence in Eq. (30).

Formalization Note The augmented Lagrangian LβL_\betaLβ​ takes values in (−∞,+∞](-\infty, +\infty](−∞,+∞], so the inequality is stated in EReal in additive form (the real terms moved to the side where they are added), which avoids extended-real subtraction. The weighted "norm" ∥x∥T2=⟨x,Tx⟩\|x\|^2_{\mathcal T} = \langle x, \mathcal T x\rangle∥x∥T2​=⟨x,Tx⟩ is defined for every self-map and can be negative when T\mathcal TT is indefinite, as 2σβγQ3−δI−T2\frac{2}{\sigma\beta\gamma}\mathcal Q_3 - \delta\mathcal I - \mathcal T_2σβγ2​Q3​−δI−T2​ may be. Iterates are indexed from 000; t≥1t \ge 1t≥1 makes xt−1x^{t-1}xt−1 meaningful.

Preamble
import Mathlib
import Definitions.Def_NonconvexSplitting_Shared_StandingAssumptions
import Definitions.Def_NonconvexSplitting_Shared_IsProxADMMSeq
import Definitions.Def_NonconvexSplitting_Shared_Assumption1
open NonconvexSplitting.Shared

open Filter Topology
open scoped InnerProductSpace
Formal statement
namespace NonconvexSplitting.ADMMBounded

/-- Eq. (20) of Li–Pong (p. 8): one-step estimate for the augmented Lagrangian along the
proximal ADMM, for `t ≥ 1`, written additively in `EReal`. -/
theorem eq20_one_step {n m : ℕ} (h : EuclideanSpace ℝ (Fin n) → ℝ) (P : EuclideanSpace ℝ (Fin m) → EReal)
    (phi : EuclideanSpace ℝ (Fin n) → ℝ) (M : EuclideanSpace ℝ (Fin n) →L[ℝ] EuclideanSpace ℝ (Fin m)) (β : ℝ)
    (hstd : StandingAssumptions h P phi β)
    (σ δ γ : ℝ) (Q1 Q2 T1 T2 Q3 : EuclideanSpace ℝ (Fin n) →L[ℝ] EuclideanSpace ℝ (Fin n))
    (hA : Assumption1 h phi M β σ Q1 Q2 T1 T2 δ Q3 γ)
    (x : ℕ → EuclideanSpace ℝ (Fin n)) (y z : ℕ → EuclideanSpace ℝ (Fin m))
    (hseq : IsProxADMMSeq h P phi M β x y z)
    (t : ℕ) (ht : 1 ≤ t) :
    augLag h P M β (x (t + 1)) (y (t + 1)) (z (t + 1)) ≤
      augLag h P M β (x t) (y t) (z t) +
        ((1 / 2 * wnormSq ((2 / (σ * β * γ)) • Q3 - δ • (1 : EuclideanSpace ℝ (Fin n) →L[ℝ] EuclideanSpace ℝ (Fin n)) - T2) (x (t + 1) - x t) +
          1 / 2 * wnormSq ((2 / (σ * β * (1 - γ))) • (T1 * T1)) (x t - x (t - 1)) : ℝ) : EReal) := by sorry

end NonconvexSplitting.ADMMBounded
Source
Li & Pong, Global Convergence of Splitting Methods for Nonconvex Composite Optimization, arXiv:1407.0753v6, p. 8, Eq. (20)
Human review
  • Endorsed by Shuze Chen · Oct 1, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 1, 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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me