Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§3.3.1 — if ∥xk−x⋆∥2≤d\|x^k-x^\star\|_2\le d∥xk−x⋆∥2​≤d then f(xk)+g(zk)−p⋆≤−(yk)Trk+d∥sk∥2≤∥yk∥2∥rk∥2+d∥sk∥2f(x^k)+g(z^k)-p^\star\le-(y^k)^Tr^k+d\|s^k\|_2\le\|y^k\|_2\|r^k\|_2+d\|s^k\|_2f(xk)+g(zk)−p⋆≤−(yk)Trk+d∥sk∥2​≤∥yk∥2​∥rk∥2​+d∥sk∥2​

Proved
BoydADMM.Convergence.suboptimality_bound

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

admmp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-bookp2o-v1stopping-criterion

Under Assumptions 1 and 2, with ρ>0\rho>0ρ>0, a saddle point (x⋆,z⋆,y⋆)(x^\star,z^\star,y^\star)(x⋆,z⋆,y⋆) of L0L_0L0​ and any ADMM run, let k≥1k\ge1k≥1 and d∈Rd\in\mathbb Rd∈R with ∥xk−x⋆∥2≤d\|x^k-x^\star\|_2\le d∥xk−x⋆∥2​≤d. Then

f(xk)+g(zk)−p⋆≤−(yk)Trk+d∥sk∥2≤∥yk∥2∥rk∥2+d∥sk∥2,f(x^k)+g(z^k)-p^\star\le-(y^k)^Tr^k+d\|s^k\|_2\le\|y^k\|_2\|r^k\|_2+d\|s^k\|_2,f(xk)+g(zk)−p⋆≤−(yk)Trk+d∥sk∥2​≤∥yk∥2​∥rk∥2​+d∥sk∥2​,

where rk=Axk+Bzk−cr^k=Ax^k+Bz^k-crk=Axk+Bzk−c and sk=ρATB(zk−zk−1)s^k=\rho A^TB(z^k-z^{k-1})sk=ρATB(zk−zk−1).

The middle and right-hand expressions are computable from the iterates once a guess ddd is fixed, and serve as approximate bounds on the suboptimality in a stopping criterion.

Formalization Note Stated at index k+1k+1k+1, k≥0k\ge0k≥0. p⋆p^\starp⋆ is the infimum optVal.

Preamble
import Mathlib
import Definitions.Def_BoydADMM_Convergence_Model
Formal statement
namespace BoydADMM.Convergence

/-- §3.3.1, p. 19: if `‖x^k − x⋆‖₂ ≤ d` then
`f(x^k) + g(z^k) − p⋆ ≤ −(y^k)ᵀr^k + d‖s^k‖₂ ≤ ‖y^k‖₂‖r^k‖₂ + d‖s^k‖₂`, for every `k ≥ 1`
(written as `k + 1`, `k ≥ 0`). -/
theorem suboptimality_bound
  {n m p : ℕ} (P : Problem n m p) (hA1 : P.Assumption1) {ρ : ℝ} (hρ : 0 < ρ)
    {xs : EuclideanSpace ℝ (Fin n)} {zs : EuclideanSpace ℝ (Fin m)}
    {ys : EuclideanSpace ℝ (Fin p)} (hsp : P.IsSaddlePoint xs zs ys)
    {x : ℕ → EuclideanSpace ℝ (Fin n)} {z : ℕ → EuclideanSpace ℝ (Fin m)}
    {y : ℕ → EuclideanSpace ℝ (Fin p)} (hrun : P.IsADMMSeq ρ x z y) (k : ℕ) (d : ℝ) (hd : ‖x (k + 1) - xs‖ ≤ d) :
    P.f (x (k + 1)) + P.g (z (k + 1)) - P.optVal ≤
        -inner ℝ (y (k + 1)) (P.resid (x (k + 1)) (z (k + 1)))
          + d * ‖P.dualResid ρ (z k) (z (k + 1))‖ ∧
      -inner ℝ (y (k + 1)) (P.resid (x (k + 1)) (z (k + 1)))
          + d * ‖P.dualResid ρ (z k) (z (k + 1))‖ ≤
        ‖y (k + 1)‖ * ‖P.resid (x (k + 1)) (z (k + 1))‖
          + d * ‖P.dualResid ρ (z k) (z (k + 1))‖ := by sorry

end BoydADMM.Convergence
Source
Boyd et al., Found. Trends Mach. Learn. 3(1) (2011), §3.3.1, p. 19
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