(55) — expanded determinant formula for the potential
ProvedVBSDP.Potential.phi_formula_55interior-point-methodsp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1semidefinite-programming
Let be a strictly feasible pair for the semidefinite program with symmetric matrices , linearly independent , matrix size , and . The potential also has the form
This is the second equality of (55), separating the primal and dual determinant terms.
Formalization Note Strict feasibility ensures the determinants and trace are positive. Linear independence is retained from the standing assumption of §4. is separate from the zero-based Fin m family.
Preamble
import Mathlib import Definitions.Def_VBSDP_Potential_IsStrictlyFeasiblePair import Definitions.Def_VBSDP_Potential_phi
Formal statement
namespace VBSDP.Potential
/-- The second line of (55), splitting the determinant of F(x)Z. -/
theorem phi_formula_55 {m n : ℕ} [NeZero n] (ν : ℝ) (hν : 1 ≤ ν)
(c : Fin m → ℝ) (F₀ : Matrix (Fin n) (Fin n) ℝ)
(F : Fin m → Matrix (Fin n) (Fin n) ℝ)
(hF₀ : F₀.IsHermitian) (hF : ∀ i, (F i).IsHermitian)
(hlin : LinearIndependent ℝ F)
(x : Fin m → ℝ) (Z : Matrix (Fin n) (Fin n) ℝ)
(h : IsStrictlyFeasiblePair c F₀ F x Z) :
phi ν F₀ F x Z =
(n + ν * Real.sqrt n) * Real.log (VBSDP.Duality.lmi F₀ F x * Z).trace -
Real.log (VBSDP.Duality.lmi F₀ F x).det - Real.log Z.det - n * Real.log n := by sorry
end VBSDP.Potential
Source
Vandenberghe and Boyd, Semidefinite Programming, SIAM Rev. 38 (1996), p. 76 (PDF p. 28), (55), with §4 assumptions on p. 70, https://doi.org/10.1137/1038003
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.