Corollary 3.4 () — and have the same Kuhn–Tucker vectors and saddle points; saddle points are the Kuhn–Tucker pairs
ProvedPenaltyLag.Exact.corollary_3_4augmented-lagrangiandualitykuhn-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). Let , and . Then:
- is a Kuhn–Tucker vector relative to if and only if it is a Kuhn–Tucker vector relative to the ordinary Lagrangian ;
- is a saddle point of on if and only if it is a saddle point of on ;
- is a saddle point of if and only if the ordinary Kuhn–Tucker conditions hold:
Comparing every with gives the paper's "relative to the Lagrangians , , one has the same Kuhn–Tucker vectors and saddle points"; the case of item 3 is a separate statement of this mission. The corollary shows what , , has in common with .
Formalization Note The standing assumption of p. 358 is a hypothesis. A Kuhn–Tucker vector relative to is (3.17) with in place of ; since for , it is automatically nonnegative. Saddle points of are compared in the extended reals.
Preamble
import Mathlib import Definitions.Def_PenaltyLag_Exact_Basic
Formal statement
namespace PenaltyLag.Exact
/-- Corollary 3.4, p. 362 (r > 0 against r = 0): L_r and L₀ have the same Kuhn–Tucker
vectors and the same saddle points, and (x̄, ȳ) is a saddle point of L_r iff the ordinary
Kuhn–Tucker conditions hold. -/
theorem corollary_3_4 {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) (xbar : E) (ybar : PenaltyLag.Asymptotic.Mult m) :
(IsKTVector X f₀ f r ybar ↔ IsKTVector0 X f₀ f ybar) ∧
(IsSaddle X f₀ f r xbar ybar ↔ IsSaddle0 X f₀ f xbar ybar) ∧
(IsSaddle X f₀ f r 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.