Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§3 after (3.17) — yˉ\bar yyˉ​ is a Kuhn–Tucker vector for LrL_rLr​ iff yˉ\bar yyˉ​ is optimal for (Dr)(D_r)(Dr​) and (P) is normal

Proved
PenaltyLag.Exact.kt_vector_iff

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

augmented-lagrangiandualitykuhn-tuckerp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Let XXX be a nonempty convex subset of a real vector space EEE and f0,f1,…,fmf_0, f_1, \dots, f_mf0​,f1​,…,fm​ convex functions on XXX, defining the convex program (P). Let r>0r > 0r>0, let LrL_rLr​ be the penalty Lagrangian (2.3), gr(y)=inf⁡x∈XLr(x,y)g_r(y) = \inf_{x \in X} L_r(x, y)gr​(y)=infx∈X​Lr​(x,y) the objective of the dual problem (Dr)(D_r)(Dr​), and let yˉ∈Rm\bar y \in \mathbb R^myˉ​∈Rm. Then yˉ\bar yyˉ​ is a Kuhn–Tucker vector for (P) relative to LrL_rLr​, that is,

−∞<inf⁡x∈XLr(x,yˉ)=inf⁡ in (P),-\infty < \inf_{x \in X} L_r(x, \bar y) = \inf \text{ in (P)},−∞<x∈Xinf​Lr​(x,yˉ​)=inf in (P),

if and only if yˉ\bar yyˉ​ is an optimal solution to (Dr)(D_r)(Dr​) and (P) is normal (the dual optimal value sup⁡yg0(y)\sup_y g_0(y)supy​g0​(y) equals the optimal value of (P)).

Together with the fact that (Dr)(D_r)(Dr​) and (D0)(D_0)(D0​) have the same optimal solutions, this shows that the notion of Kuhn–Tucker vector does not depend on rrr. It is the step that turns the hypotheses of Theorem 3.5 (normality and dual optimality) into a Kuhn–Tucker vector.

Formalization Note The paper states the standing assumption (convexity of XXX and the fif_ifi​, X≠∅X \ne \emptysetX=∅) once on p. 358; here it is a hypothesis. "Optimal solution to (Dr)(D_r)(Dr​)" means gr(yˉ)=sup⁡ygr(y)g_r(\bar y) = \sup_y g_r(y)gr​(yˉ​)=supy​gr​(y) with gr(yˉ)>−∞g_r(\bar y) > -\inftygr​(yˉ​)>−∞ (the convention of p. 361). Infima and suprema are taken in the extended reals; indices are 0-based (Fin m).

Preamble
import Mathlib
import Definitions.Def_PenaltyLag_Exact_Basic
Formal statement
namespace PenaltyLag.Exact

/-- §3 after (3.17), pp. 361–362: for r > 0, ȳ is a Kuhn–Tucker vector relative to L_r
iff ȳ is an optimal solution to (D_r) and (P) is normal. -/
theorem kt_vector_iff {E : Type*} [AddCommGroup E] [Module ℝ E] {m : ℕ}
    (X : Set E) (hX : Convex ℝ X) (hXne : X.Nonempty)
    (f₀ : E → ℝ) (f : Fin m → E → ℝ) (hf₀ : ConvexOn ℝ X f₀) (hf : ∀ i, ConvexOn ℝ X (f i))
    (r : ℝ) (hr : 0 < r) (ybar : PenaltyLag.Asymptotic.Mult m) :
    IsKTVector X f₀ f r ybar ↔ (IsDualOptimal X f₀ f r ybar ∧ IsNormal X f₀ f) := by sorry

end PenaltyLag.Exact
Source
Rockafellar, A Dual Approach to Solving Nonlinear Programming Problems by Unconstrained Optimization, Math. Programming 5 (1973), §3, after (3.17), pp. 361–362
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