Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

App. A, proof of Lemma 5 — λ − (M − I/μ)⁻¹g is the unique maximizer of ½(ν−λ)ᵀM(ν−λ) + νᵀg − ‖ν−λ‖²/(2μ)

Proved
ALADIN.DualDecomp.argmax_display

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

dual-decompositionp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1quadratic-programming

Let M∈Rm×mM\in\mathbb R^{m\times m}M∈Rm×m be symmetric negative semidefinite, μ>0\mu > 0μ>0, and λ,g∈Rm\lambda, g\in\mathbb R^mλ,g∈Rm. Define

φ(ν)=12(ν−λ)⊤M(ν−λ)+ν⊤g−12μ∥ν−λ∥22.\varphi(\nu) = \tfrac12(\nu-\lambda)^\top M(\nu-\lambda) + \nu^\top g - \frac{1}{2\mu}\|\nu-\lambda\|_2^2 .φ(ν)=21​(ν−λ)⊤M(ν−λ)+ν⊤g−2μ1​∥ν−λ∥22​.

Then M−1μIM - \frac1\mu IM−μ1​I is invertible and

ν⋆=λ−(M−1μI)−1g\nu^\star = \lambda - \Big(M - \frac1\mu I\Big)^{-1} gν⋆=λ−(M−μ1​I)−1g

is the unique maximizer of φ\varphiφ over Rm\mathbb R^mRm.

In the proof of Lemma 5, with g=∇V(λ)g = \nabla V(\lambda)g=∇V(λ) and MMM from (A.6), φ\varphiφ is the dual objective of the QP (3.3) after the slack and Δy\Delta yΔy have been eliminated, and the display identifies its maximizer λQP\lambda_{\mathrm{QP}}λQP​ with the Levenberg–Marquardt dual Newton direction.

Preamble
import Mathlib
Formal statement
namespace ALADIN.DualDecomp

open Matrix

/-- App. A, proof of Lemma 5, p. 1124 (the argmax display): let `M ∈ ℝ^{m×m}` be symmetric and negative
semidefinite, `μ > 0`, `λ ∈ ℝᵐ` and `g ∈ ℝᵐ` (in the paper `g = ∇V(λ)`). Then `M − (1/μ) I` is invertible
and `ν⋆ = λ − (M − (1/μ) I)⁻¹ g` is the unique maximizer over `ℝᵐ` of
`ν ↦ ½ (ν − λ)ᵀ M (ν − λ) + νᵀ g − (1/(2μ)) ‖ν − λ‖²₂`. -/
theorem argmax_display {m : ℕ} (M : Matrix (Fin m) (Fin m) ℝ) (hM : (-M).PosSemidef)
    (μ : ℝ) (hμ : 0 < μ) (lam g : Fin m → ℝ) :
    let φ : (Fin m → ℝ) → ℝ := fun ν =>
      1 / 2 * ((ν - lam) ⬝ᵥ (M *ᵥ (ν - lam))) + ν ⬝ᵥ g - 1 / (2 * μ) * ((ν - lam) ⬝ᵥ (ν - lam))
    let νstar := lam - (M - μ⁻¹ • (1 : Matrix (Fin m) (Fin m) ℝ))⁻¹ *ᵥ g
    IsUnit (M - μ⁻¹ • (1 : Matrix (Fin m) (Fin m) ℝ)).det ∧
    IsMaxOn φ Set.univ νstar ∧
    ∀ ν, φ ν = φ νstar → ν = νstar := by sorry

end ALADIN.DualDecomp
Source
Houska, Frasch, Diehl, An augmented Lagrangian based algorithm for distributed nonconvex optimization, SIAM J. Optim. 26 (2016), p. 1124, App. A, proof of Lemma 5, argmax 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