Weak duality of optimal values
ProvedVBSDP.Duality.weak_duality_valuesdualityp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1semidefinite-programming
For the optimal values of the primal semidefinite program (1) and its dual (27),
The inequality also includes empty feasible sets and unbounded objectives under the extended-real conventions.
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_pStar import Definitions.Def_VBSDP_Duality_dStar
Formal statement
namespace VBSDP.Duality
theorem weak_duality_values {m n : ℕ} (c : Fin m → ℝ)
(F₀ : Matrix (Fin n) (Fin n) ℝ) (F : Fin m → Matrix (Fin n) (Fin n) ℝ) :
dStar c F₀ F ≤ pStar c F₀ F := by sorry
end VBSDP.Duality
Source
Vandenberghe and Boyd, Semidefinite Programming, SIAM Review 38(1) (1996), p. 64, sentence following definition of d*, 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.