Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§6.1.1, p. 40 — the Huber-fitting z-update is ρ1+ρv+11+ρS1+1/ρ(v)\frac{\rho}{1+\rho}v+\frac{1}{1+\rho}S_{1+1/\rho}(v)1+ρρ​v+1+ρ1​S1+1/ρ​(v), v=Axk+1−b+ukv=Ax^{k+1}-b+u^kv=Axk+1−b+uk

Proved
BoydADMM.L1.huber_z_update

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

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

Let A∈Rm×nA\in\mathbb R^{m\times n}A∈Rm×n, b,u∈Rmb,u\in\mathbb R^mb,u∈Rm, x∈Rnx\in\mathbb R^nx∈Rn and ρ>0\rho>0ρ>0, and put v=Ax−b+uv=Ax-b+uv=Ax−b+u. The vector z⋆∈Rmz^\star\in\mathbb R^mz⋆∈Rm with components

zi⋆=ρ1+ρ vi+11+ρ S1+1/ρ(vi)z^\star_i=\frac{\rho}{1+\rho}\,v_i+\frac{1}{1+\rho}\,S_{1+1/\rho}(v_i)zi⋆​=1+ρρ​vi​+1+ρ1​S1+1/ρ​(vi​)

is the unique minimizer over z∈Rmz\in\mathbb R^mz∈Rm of

ghub(z)+ρ2∥Ax−z−b+u∥22,g^{\mathrm{hub}}(z)+\frac\rho2\|Ax-z-b+u\|_2^2,ghub(z)+2ρ​∥Ax−z−b+u∥22​,

where ghub(z)=∑ighub(zi)g^{\mathrm{hub}}(z)=\sum_i g^{\mathrm{hub}}(z_i)ghub(z)=∑i​ghub(zi​) is the Huber penalty with transition at level 111 and SκS_\kappaSκ​ is soft thresholding applied elementwise.

With x=xk+1x=x^{k+1}x=xk+1 and u=uku=u^ku=uk this is the z-update of scaled-form ADMM for Huber fitting, minimize ghub(Ax−b)g^{\mathrm{hub}}(Ax-b)ghub(Ax−b), written with the constraint Ax−z=bAx-z=bAx−z=b: the proximity operator of the Huber function.

Formalization Note Vectors are EuclideanSpace ℝ (Fin m) and AAA acts by Matrix.toEuclideanLin. The formula is applied componentwise, as the book's S1+1/ρS_{1+1/\rho}S1+1/ρ​ is.

Preamble
import Mathlib
import Definitions.Def_BoydADMM_L1_Basic

open Matrix
Formal statement
namespace BoydADMM.L1

/-- §6.1.1, p. 40: for `ρ > 0`, with `v = Ax − b + u`, the vector with components
`(ρ/(1+ρ)) v_i + (1/(1+ρ)) S_{1+1/ρ}(v_i)` is the unique minimizer of
`g^hub(z) + (ρ/2)‖Ax − z − b + u‖₂²` over `z ∈ ℝᵐ`. -/
theorem huber_z_update {m n : ℕ} (A : Matrix (Fin m) (Fin n) ℝ) (b u : EuclideanSpace ℝ (Fin m))
    (x : EuclideanSpace ℝ (Fin n)) (ρ : ℝ) (hρ : 0 < ρ) :
    IsUniqueMinimizerOn
      (fun z : EuclideanSpace ℝ (Fin m) =>
        huberVec z + (ρ / 2) * ‖Matrix.toEuclideanLin A x - z - b + u‖ ^ 2) Set.univ
      (WithLp.toLp 2 fun i =>
        ρ / (1 + ρ) * (Matrix.toEuclideanLin A x - b + u) i +
          1 / (1 + ρ) * BoydADMM.Prox.softThreshold (1 + 1 / ρ) ((Matrix.toEuclideanLin A x - b + u) i)) := by sorry

end BoydADMM.L1
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. 40, §6.1.1 (Huber fitting); ADMM form from §6.1, p. 39
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