Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(2.10), p. 2277 — weak duality: K(x, z; y) ≥ d(y, z) for x ∈ P, and M(z) ≥ d(y, z)

Proved
ProxADMMLC.Conv.eq_2_10

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

admmaugmented-lagrangianp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1weak-duality

Let KKK be the proximal augmented Lagrangian (2.5), let x(y,z)x(y,z)x(y,z) be a minimizer of K(⋅,z;y)K(\cdot,z;y)K(⋅,z;y) over the box PPP with value d(y,z)d(y,z)d(y,z) (2.6)–(2.7), and let x∗(z)x^*(z)x∗(z) be a minimizer of f(x)+p2∥x−z∥2f(x)+\frac p2\|x-z\|^2f(x)+2p​∥x−z∥2 over {x∈P:Ax=b}\{x\in P:Ax=b\}{x∈P:Ax=b} with value M(z)M(z)M(z) (2.8)–(2.9). Then for all y∈Rmy\in\mathbb R^my∈Rm and z∈Rnz\in\mathbb R^nz∈Rn,

K(x,z;y) ≥ d(y,z)(x∈P),M(z) ≥ d(y,z).K(x,z;y)\ \ge\ d(y,z)\quad(x\in P),\qquad M(z)\ \ge\ d(y,z).K(x,z;y) ≥ d(y,z)(x∈P),M(z) ≥ d(y,z).

The two inequalities make each of the bracketed terms of the potential ϕt=(K−d)+(M−d)+M\phi^t=(K-d)+(M-d)+Mϕt=(K−d)+(M−d)+M nonnegative, which is how the potential is bounded below in (3.5).

Formalization Note The page writes the first inequality for all y,zy,zy,z without x∈Px\in Px∈P; since ddd is a minimum over PPP, it holds for x∈Px\in Px∈P, and the hypothesis x∈Px\in Px∈P is added (every use has x=xt∈Px=x^t\in Px=xt∈P). No assumption on fff, Γ\GammaΓ or ppp is needed beyond the existence of the two minimizers, which are given as selections.

Preamble
import Mathlib
import Definitions.Def_ProxADMMLC_Conv_Setting
Formal statement
namespace ProxADMMLC.Conv

theorem eq_2_10 {n m : ℕ} (f : E n → ℝ) (A : E n →L[ℝ] E m) (b : E m) (ℓ u : Fin n → ℝ)
    (Γ p : ℝ) (xs : E m → E n → E n) (hxs : IsXSel f A b ℓ u Γ p xs)
    (xst : E n → E n) (hxst : IsXStarSel f A b ℓ u p xst) :
    (∀ x ∈ box ℓ u, ∀ (y : E m) (z : E n), dval f A b Γ p xs y z ≤ K f A b Γ p x z y) ∧
      ∀ (y : E m) (z : E n), dval f A b Γ p xs y z ≤ Mval f p xst z := by sorry

end ProxADMMLC.Conv
Source
Zhang & Luo, A proximal alternating direction method of multiplier for linearly constrained nonconvex minimization, SIAM J. Optim. 30(3) (2020), p. 2277, (2.10)
Human review
  • Endorsed by Shuze Chen · Oct 10, 2026

    Confirmed by the moderator at approval.

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