Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§3.3 — zk+1z^{k+1}zk+1 and yk+1y^{k+1}yk+1 always satisfy (3.10): 0∈∂g(zk+1)+BTyk+10\in\partial g(z^{k+1})+B^Ty^{k+1}0∈∂g(zk+1)+BTyk+1

Proved
BoydADMM.Convergence.z_update_dual_feasible

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

admmoptimality-conditionsp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-bookp2o-v1subdifferential

Let f,gf,gf,g satisfy Assumption 1 (closed, proper, convex), let ρ>0\rho>0ρ>0, and let (xk,zk,yk)(x^k,z^k,y^k)(xk,zk,yk) be any ADMM run (3.2)–(3.4) for problem (3.1). Then for every k≥0k\ge0k≥0,

0∈∂g(zk+1)+BTyk+1,0\in\partial g(z^{k+1})+B^Ty^{k+1},0∈∂g(zk+1)+BTyk+1,

that is, the pair (zk+1,yk+1)(z^{k+1},y^{k+1})(zk+1,yk+1) satisfies the dual feasibility condition (3.10) at every iteration. Here ∂g(z)\partial g(z)∂g(z) is the subdifferential of ggg at z∈dom⁡gz\in\operatorname{dom}gz∈domg: the set of vvv with g(z′)≥g(z)+vT(z′−z)g(z')\ge g(z)+v^T(z'-z)g(z′)≥g(z)+vT(z′−z) for all z′∈dom⁡gz'\in\operatorname{dom}gz′∈domg.

Consequently optimality of ADMM iterates reduces to the two remaining conditions, primal feasibility (3.8) and dual feasibility (3.9).

Formalization Note The statement is written as −BTyk+1∈∂g(zk+1)-B^Ty^{k+1}\in\partial g(z^{k+1})−BTyk+1∈∂g(zk+1) with the published subdifferential ShorNonsmooth.Subdiff.subdifferential relative to M=dom⁡gM=\operatorname{dom}gM=domg, which is the convex-analysis subdifferential of the extended-valued ggg at a point of its domain.

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

/-- §3.3, p. 18: `z^{k+1}` and `y^{k+1}` always satisfy (3.10),
`0 ∈ ∂g(z^{k+1}) + Bᵀy^{k+1}`, i.e. `−Bᵀy^{k+1} ∈ ∂g(z^{k+1})`, for every `k ≥ 0`. -/
theorem z_update_dual_feasible
  {n m p : ℕ} (P : Problem n m p) (hA1 : P.Assumption1) {ρ : ℝ} (hρ : 0 < ρ)
    {x : ℕ → EuclideanSpace ℝ (Fin n)} {z : ℕ → EuclideanSpace ℝ (Fin m)}
    {y : ℕ → EuclideanSpace ℝ (Fin p)} (hrun : P.IsADMMSeq ρ x z y) (k : ℕ) :
    -P.BTmul (y (k + 1)) ∈ ShorNonsmooth.Subdiff.subdifferential P.Cg P.g (z (k + 1)) := by sorry

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