Equation (31): weak duality
ProvedVBSDP.Duality.weak_duality_31dualityp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1semidefinite-programming
For every primal feasible and dual feasible ,
Every dual feasible objective value therefore bounds every primal feasible objective value from below.
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 weak_duality_31 {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) :
-(F₀ * Z).trace ≤ c ⬝ᵥ x := by sorry
end VBSDP.Duality
Source
Vandenberghe and Boyd, Semidefinite Programming, SIAM Review 38(1) (1996), p. 64, equation (31), PDF p. 16, https://doi.org/10.1137/1038003
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.