Stationarity and complementary slackness extraction
ProvedVectorSpaceOpt.kkt_complementary_slacknesscomplementary-slacknessdual-positivekktstationarity
Let a cone-positive continuous functional z₀ accompany a feasible constraint value xConstraint. Suppose the separating inequality
holds for every direction h in the decision space. Then the part linear in h must vanish, and the remaining constant is forced to vanish by feasibility and positivity. Consequently, f' + z₀ ∘ G' = 0 and z₀(xConstraint) = 0. This theorem isolates the sign-sensitive algebra at the end of p. 250. It is a small but valuable reusable interface: geometric separation need only produce the universal affine inequality, after which stationarity and complementary slackness follow without any further topology or differentiability.
Preamble
import Definitions.Def_VectorSpaceOpt_cone_optimization
Formal statement
namespace VectorSpaceOpt
/-- The stationarity and complementary-slackness extraction on p. 250. -/
theorem kkt_complementary_slackness
{X Z : Type*}
[NormedAddCommGroup X] [NormedSpace ℝ X]
[NormedAddCommGroup Z] [NormedSpace ℝ Z]
(P : ConvexCone ℝ Z) (xConstraint : Z)
(f' : X →L[ℝ] ℝ) (G' : X →L[ℝ] Z) (z₀ : Z →L[ℝ] ℝ)
(hz : dualPositive P z₀) (hfeas : coneLE P xConstraint 0)
(hsep : ∀ h : X, 0 ≤ f' h + z₀ (xConstraint + G' h)) :
f' + z₀.comp G' = 0 ∧ z₀ xConstraint = 0 := by
sorry
end VectorSpaceOptSource
David G. Luenberger, Optimization by Vector Space Methods (Wiley, 1969), Chapter 9, §9.4, final extraction in the proof of Theorem 1, printed p. 250 (physical PDF p. 268). Scan: https://sites.science.oregonstate.edu/~show/old/142_Luenberger.pdf