(24)–(25), p. 9 — HKM: M_i = (⟨x,z⟩/γ²(z)) AᵀJA + u vᵀ + v uᵀ, u = Aᵀx, v = Aᵀ(z⁰; −z¹)/γ²(z)
ProvedSDPT3.ScaleInv.eq_24interior-pointp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1schur-complementsecond-order-cone
Let be in the interior of the second-order cone, , , and . The block of the Schur complement matrix (22) satisfies
with as in (25).
This is the formula SDPT3 uses to assemble the HKM Schur complement matrix, and the one through which the proof of Proposition 1 sees that is invariant under scaling.
Formalization Note As for (23), only interiority of is used, and is arbitrary.
Preamble
import Mathlib import Definitions.Def_SDPT3_ScaleInv_Setting
Formal statement
namespace SDPT3.ScaleInv
open Matrix
theorem eq_24 {k m : ℕ} (Ai : Matrix (Fin (k + 1)) (Fin m) ℝ) (x z : Fin (k + 1) → ℝ)
(hz : socInt z) :
Mblock (GHKM z) Ai x z =
((x ⬝ᵥ z) / gammaSq z) • (Aiᵀ * J k * Ai) +
vecMulVec (Aiᵀ *ᵥ x) (Aiᵀ *ᵥ ((gammaSq z)⁻¹ • (Jbar k *ᵥ z))) +
vecMulVec (Aiᵀ *ᵥ ((gammaSq z)⁻¹ • (Jbar k *ᵥ z))) (Aiᵀ *ᵥ x) := by sorry
end SDPT3.ScaleInv
Source
Tütüncü, Toh & Todd, Solving semidefinite-quadratic-linear programs using SDPT3, Math. Program. 95 (2003) 189–217; authors' copy, p. 8, (22); p. 9, (24)–(25)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.