Corollary 3.4 () — is a saddle point of iff the ordinary Kuhn–Tucker conditions hold
ProvedPenaltyLag.Exact.corollary_3_4_r0dualitykuhn-tuckerp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1saddle-point
Let be a nonempty convex subset of a real vector space and convex functions on , defining the convex program (P), and let be its ordinary Lagrangian (3.2): if and otherwise. For and , the pair is a saddle point of on ,
if and only if the ordinary Kuhn–Tucker conditions hold: (i) , , for , and (ii) minimizes over .
This is the case of Corollary 3.4, the classical saddle-point form of the Kuhn–Tucker conditions.
Formalization Note The standing assumption of p. 358 is a hypothesis. is extended-real valued and the inequalities are in the extended reals; ranges over all of , with off the nonnegative orthant as in (3.2).
Preamble
import Mathlib import Definitions.Def_PenaltyLag_Exact_Basic
Formal statement
namespace PenaltyLag.Exact
/-- Corollary 3.4, p. 362, the case r = 0: (x̄, ȳ) is a saddle point of the ordinary
Lagrangian L₀ iff the ordinary Kuhn–Tucker conditions hold. -/
theorem corollary_3_4_r0 {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))
(xbar : E) (ybar : PenaltyLag.Asymptotic.Mult m) :
IsSaddle0 X f₀ f xbar ybar ↔ KuhnTuckerConditions X f₀ f xbar ybar := by sorry
end PenaltyLag.Exact
Source
Rockafellar, A Dual Approach to Solving Nonlinear Programming Problems by Unconstrained Optimization, Math. Programming 5 (1973), p. 362, Corollary 3.4 (case r = 0)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.