Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(7.4): the regularized consensus zzz-update is averaging followed by a proximal step with weight NρN\rhoNρ

Proved
BoydADMM.Consensus.regularized_z_update_prox

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

admmconsensusp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-bookp2o-v1proximal-operator

Let N≥1N\ge1N≥1, ρ>0\rho>0ρ>0, and let g:Rn→R∪{+∞}g:\mathbb R^n\to\mathbb R\cup\{+\infty\}g:Rn→R∪{+∞} be any regularizer. Fix x1,…,xNx_1,\dots,x_Nx1​,…,xN​ (standing for xik+1x_i^{k+1}xik+1​) and y1,…,yNy_1,\dots,y_Ny1​,…,yN​ (standing for yiky_i^kyik​). Then a point z∈dom⁡gz\in\operatorname{dom} gz∈domg minimizes the zzz-update objective (7.4)

g(z)+∑i=1N(−yiTz+(ρ/2)∥xi−z∥22)g(z)+\sum_{i=1}^N\big(-y_i^{T}z+(\rho/2)\|x_i-z\|_2^2\big)g(z)+i=1∑N​(−yiT​z+(ρ/2)∥xi​−z∥22​)

over dom⁡g\operatorname{dom} gdomg if and only if it minimizes the proximal objective

g(z)+(Nρ/2) ∥z−xˉ−(1/ρ)yˉ∥22g(z)+(N\rho/2)\,\|z-\bar x-(1/\rho)\bar y\|_2^2g(z)+(Nρ/2)∥z−xˉ−(1/ρ)yˉ​∥22​

over dom⁡g\operatorname{dom} gdomg.

So the central collector first averages and then applies the proximal operator of ggg with parameter NρN\rhoNρ.

Formalization Note Each extended-real-valued function φ:Rn→R∪{+∞}\varphi:\mathbb R^n\to\mathbb R\cup\{+\infty\}φ:Rn→R∪{+∞} of the book is encoded by its effective domain dom⁡φ\operatorname{dom}\varphidomφ (a set) and its finite values on it (a real function); a minimization of a sum containing φ\varphiφ is a minimization over dom⁡φ\operatorname{dom}\varphidomφ. No convexity of ggg is needed: the two objectives differ by a constant independent of zzz. The minimizer sets are compared, not a selected minimizer.

Preamble
import Mathlib
import Definitions.Def_BoydADMM_Consensus_Model

open scoped BigOperators InnerProductSpace
Formal statement
namespace BoydADMM.Consensus

/-- §7.1.1, p. 52: for a regularizer `g` with effective domain `Cg`, the `z`-update (7.4)
`argmin_z (g(z) + ∑_i (−y_i^{kT} z + (ρ/2)‖x_i^{k+1} − z‖²))` has exactly the same
minimizers as the averaging-then-proximal step
`argmin_z (g(z) + (Nρ/2)‖z − x̄^{k+1} − (1/ρ)ȳ^k‖²)`. Here `x`, `y` stand for `x^{k+1}`, `y^k`. -/
theorem regularized_z_update_prox {n N : ℕ} (hN : 0 < N) (ρ : ℝ) (hρ : 0 < ρ)
    (Cg : Set (EuclideanSpace ℝ (Fin n))) (g : EuclideanSpace ℝ (Fin n) → ℝ)
    (x y : Fin N → EuclideanSpace ℝ (Fin n)) (z : EuclideanSpace ℝ (Fin n)) :
    (z ∈ Cg ∧ ∀ z' ∈ Cg,
        g z + ∑ i, (-⟪y i, z⟫_ℝ + (ρ / 2) * ‖x i - z‖ ^ 2) ≤
          g z' + ∑ i, (-⟪y i, z'⟫_ℝ + (ρ / 2) * ‖x i - z'‖ ^ 2)) ↔
      (z ∈ Cg ∧ ∀ z' ∈ Cg,
        g z + ((N : ℝ) * ρ / 2) * ‖z - avg x - (1 / ρ) • avg y‖ ^ 2 ≤
          g z' + ((N : ℝ) * ρ / 2) * ‖z' - avg x - (1 / ρ) • avg y‖ ^ 2) := 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), p. 52, §7.1.1, (7.4) and the averaging-plus-proximal form of the z-update
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