Complementary slackness for an optimal primal–dual pair
ProvedVBSDP.Duality.compl_slacknessdualityp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1semidefinite-programming
Suppose is primal feasible, is dual feasible, and their objective values agree: . Then
Feasibility and equality of objective values make both points optimal, so this is the paper’s complementary slackness condition.
This statement supplies a target in the duality development.
Formalization Note Matrices have dimension , with coefficients indexed in Lean from 0 and passed separately. Positive semidefiniteness and positive definiteness are matrix conditions; trace is the matrix trace.
Preamble
import Mathlib import Definitions.Def_VBSDP_Duality_IsPrimalFeasible import Definitions.Def_VBSDP_Duality_IsDualFeasible
Formal statement
namespace VBSDP.Duality
theorem compl_slackness {m n : ℕ} (c : Fin m → ℝ)
(F₀ : Matrix (Fin n) (Fin n) ℝ) (F : Fin m → Matrix (Fin n) (Fin n) ℝ)
(x : Fin m → ℝ) (Z : Matrix (Fin n) (Fin n) ℝ)
(hx : IsPrimalFeasible F₀ F x) (hZ : IsDualFeasible F c Z)
(hopt : c ⬝ᵥ x = -(F₀ * Z).trace) :
Z * lmi F₀ F x = 0 := by sorry
end VBSDP.Duality
Source
Vandenberghe and Boyd, Semidefinite Programming, SIAM Review 38(1) (1996), p. 65, complementary slackness, PDF p. 17, https://doi.org/10.1137/1038003
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.