Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

App. A, proof of Lemma 5 — with ρ = 0 the step-1 output satisfies 0 = ∇fᵢ(yᵢ) + Aᵢᵀλ + (C*ᵢ)ᵀκᵢ = gᵢ + Aᵢᵀλ + Cᵢᵀκᵢ

Proved
ALADIN.DualDecomp.stationarity

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

dual-decompositionkkt-conditionsp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Let (f,h,A,b)(f,h,A,b)(f,h,A,b) be an instance of problem (1.1) and fix a block iii. Suppose fif_ifi​ and hih_ihi​ are twice continuously differentiable, and (yi,κi)(y_i,\kappa_i)(yi​,κi​) is a step-1 output of Algorithm 2 for block iii with penalty parameter ρ=0\rho = 0ρ=0 (any scaling matrix Σi\Sigma_iΣi​, any xix_ixi​, dual iterate λ\lambdaλ), so that yiy_iyi​ solves (A.2) with multiplier κi\kappa_iκi​. Then for every matrix Ci∈Rnh×nC_i\in\mathbb R^{n_h\times n}Ci​∈Rnh​×n,

0=∇fi(yi)+Ai⊤λ+(Ci∗)⊤κi=gi+Ai⊤λ+Ci⊤κi,0 = \nabla f_i(y_i) + A_i^\top\lambda + (C^*_i)^\top\kappa_i = g_i + A_i^\top\lambda + C_i^\top\kappa_i,0=∇fi​(yi​)+Ai⊤​λ+(Ci∗​)⊤κi​=gi​+Ai⊤​λ+Ci⊤​κi​,

where Ci∗C^*_iCi∗​ is the active-constraint Jacobian at yiy_iyi​ and gi=∇fi(yi)+(Ci∗−Ci)⊤κig_i = \nabla f_i(y_i) + (C^*_i - C_i)^\top\kappa_igi​=∇fi​(yi​)+(Ci∗​−Ci​)⊤κi​ is the modified gradient of step 3.

This is the stationarity condition of (A.2) rewritten with the modified gradient; in the proof of Lemma 5 it eliminates gig_igi​ from the dual of the QP (3.3).

Preamble
import Mathlib
import Definitions.Def_ALADIN_DualDecomp_Problem
import Definitions.Def_ALADIN_DualDecomp_Step
Formal statement
namespace ALADIN.DualDecomp

open Matrix

/-- App. A, proof of Lemma 5, p. 1123: if `(yᵢ, κᵢ)` is the output of Algorithm 2, step 1 with `ρ = 0`
(so (3.2) is (A.2)), and `fᵢ`, `hᵢ` are twice continuously differentiable, then for every
choice of `Cᵢ`,
`0 = ∇fᵢ(yᵢ) + Aᵢᵀ λ + (C*ᵢ)ᵀ κᵢ = gᵢ + Aᵢᵀ λ + Cᵢᵀ κᵢ`. -/
theorem stationarity {N n m nh : ℕ} (P : Problem N n m nh) (Sig : Matrix (Fin n) (Fin n) ℝ)
    (x : Fin n → ℝ) (lam : Fin m → ℝ) (i : Fin N) (yi : Fin n → ℝ) (κi : Fin nh → ℝ)
    (Ci : Matrix (Fin nh) (Fin n) ℝ)
    (hf : ContDiff ℝ 2 (P.f i)) (hh : ContDiff ℝ 2 (P.h i))
    (hstep1 : Step1Solution P 0 Sig x lam i yi κi) :
    grad (P.f i) yi + (P.A i)ᵀ *ᵥ lam + (Cstar P i yi)ᵀ *ᵥ κi = 0 ∧
    modGrad P i yi κi Ci + (P.A i)ᵀ *ᵥ lam + Ciᵀ *ᵥ κi = 0 := by sorry

end ALADIN.DualDecomp
Source
Houska, Frasch, Diehl, An augmented Lagrangian based algorithm for distributed nonconvex optimization, SIAM J. Optim. 26 (2016), pp. 1123–1124, App. A, proof of Lemma 5, stationarity display
Human review
  • Endorsed by Shuze Chen · Oct 8, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 8, 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