A Lagrangian saddle point is primal optimal
DisprovedVectorSpaceOpt.lagrangian_saddle_sufficientlagrangianoptimality-certificatesaddle-pointstrong-duality
Let be a closed convex cone, , and let be dual-positive. Assume is a saddle point in the orientation
for every dual-positive and every . Then , and minimizes over all feasible points in . The theorem does not assume feasibility separately; closed-cone dual separation makes it a conclusion. This source milestone packages a certificate that is useful independently of convexity or Slater hypotheses and fixes the maximizing multiplier/minimizing primal orientation used by the capstone. It can serve as a standalone verification theorem for candidate solutions.
Preamble
import Definitions.Def_VectorSpaceOpt_coneLE import Definitions.Def_VectorSpaceOpt_dualPositive import Definitions.Def_VectorSpaceOpt_lagrangian
Formal statement
namespace VectorSpaceOpt
/-- Luenberger, Chapter 8, §8.4, Theorem 2. -/
theorem lagrangian_saddle_sufficient
{X Z : Type*}
[NormedAddCommGroup Z] [NormedSpace ℝ Z]
(P : ConvexCone ℝ Z) (Ω : Set X) (f : X → ℝ) (G : X → Z)
(x₀ : X) (zstar₀ : Z →L[ℝ] ℝ)
(hP : IsClosed (P : Set Z)) (hx₀ : x₀ ∈ Ω)
(hzstar₀ : dualPositive P zstar₀)
(hleft : ∀ zstar : Z →L[ℝ] ℝ, dualPositive P zstar →
lagrangian f G zstar x₀ ≤ lagrangian f G zstar₀ x₀)
(hright : ∀ x ∈ Ω,
lagrangian f G zstar₀ x₀ ≤ lagrangian f G zstar₀ x) :
coneLE P (G x₀) 0 ∧
∀ x ∈ Ω, coneLE P (G x) 0 → f x₀ ≤ f x := by sorry
end VectorSpaceOptSource
David G. Luenberger, Optimization by Vector Space Methods, Wiley, 1969, public scan https://sites.science.oregonstate.edu/~show/old/142_Luenberger.pdf, Chapter 8, §8.4, Theorem 2, printed p. 221; physical PDF p. 241.