Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Consensus ADMM: the zzz-update is zk+1=xˉk+1+(1/ρ)yˉkz^{k+1}=\bar x^{k+1}+(1/\rho)\bar y^kzk+1=xˉk+1+(1/ρ)yˉ​k

Proved
BoydADMM.Consensus.consensus_z_update_average

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

admmconsensusp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-bookp2o-v1

Consider global variable consensus with N≥1N\ge1N≥1 agents and ρ>0\rho>0ρ>0. Fix x1,…,xN∈Rnx_1,\dots,x_N\in\mathbb R^nx1​,…,xN​∈Rn (the new local iterates xik+1x_i^{k+1}xik+1​) and y1,…,yN∈Rny_1,\dots,y_N\in\mathbb R^ny1​,…,yN​∈Rn (the dual variables yiky_i^kyik​). The zzz-update of ADMM minimizes the augmented Lagrangian

Lρ(x1,…,xN,z,y)=∑i=1N(fi(xi)+yiT(xi−z)+(ρ/2)∥xi−z∥22)L_\rho(x_1,\dots,x_N,z,y)=\sum_{i=1}^N\big(f_i(x_i)+y_i^T(x_i-z)+(\rho/2)\|x_i-z\|_2^2\big)Lρ​(x1​,…,xN​,z,y)=i=1∑N​(fi​(xi​)+yiT​(xi​−z)+(ρ/2)∥xi​−z∥22​)

over z∈Rnz\in\mathbb R^nz∈Rn. Its minimizer is unique and equals the average step:

z minimizes Lρ(x,⋅,y)  ⟺  z=xˉ+(1/ρ)yˉ.z \text{ minimizes } L_\rho(x,\cdot,y)\iff z=\bar x+(1/\rho)\bar y.z minimizes Lρ​(x,⋅,y)⟺z=xˉ+(1/ρ)yˉ​.

This is why the central collector of consensus ADMM only has to average.

Formalization Note The book states the algorithm with the averaging formula (p. 49) and rewrites it with overlines (p. 50); the statement here is the underlying fact that this formula is the exact (and unique) minimizer of LρL_\rhoLρ​ in zzz. The terms fi(xi)f_i(x_i)fi​(xi​) are constants in zzz and are kept as in LρL_\rhoLρ​. The hypotheses N≥1N\ge1N≥1 and ρ>0\rho>0ρ>0 are implicit in the book.

Preamble
import Mathlib
import Definitions.Def_BoydADMM_Consensus_Model

open scoped BigOperators InnerProductSpace
Formal statement
namespace BoydADMM.Consensus

/-- §7.1, pp. 49–50: the consensus `z`-update, the minimization of
`L_ρ(x^{k+1}, z, y^k)` over `z ∈ ℝⁿ`, has the unique solution `z = x̄^{k+1} + (1/ρ) ȳ^k`. The
terms `f_i(x_i^{k+1})` of `L_ρ` do not depend on `z` and are kept. -/
theorem consensus_z_update_average {n N : ℕ} (hN : 0 < N) (ρ : ℝ) (hρ : 0 < ρ)
    (f : Fin N → EuclideanSpace ℝ (Fin n) → ℝ)
    (x y : Fin N → EuclideanSpace ℝ (Fin n)) (z : EuclideanSpace ℝ (Fin n)) :
    (∀ z' : EuclideanSpace ℝ (Fin n),
        ∑ i, (f i (x i) + ⟪y i, x i - z⟫_ℝ + (ρ / 2) * ‖x i - z‖ ^ 2) ≤
          ∑ i, (f i (x i) + ⟪y i, x i - z'⟫_ℝ + (ρ / 2) * ‖x i - z'‖ ^ 2)) ↔
      z = avg x + (1 / ρ) • avg y := by sorry

end BoydADMM.Consensus
Source
Boyd, Parikh, Chu, Peleato, Eckstein, Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers, Found. Trends Mach. Learn. 3(1) (2011), pp. 49–50, §7.1 (ADMM for (7.1) and its simplification z^{k+1} = x̄^{k+1} + (1/ρ)ȳ^k)
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