(29), p. 11 — NT: Gx = G⁻¹z and ℰ⁻¹ℱ = G⁻² = (J + 2 t̃ t̃ᵀ)/ω², t̃ = (t⁰; −t¹)
ProvedSDPT3.ScaleInv.nt_eq_29interior-pointnesterov-toddp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1second-order-cone
Let lie in the interior of the second-order cone, and let be the NT scaling (21), with and as in (20)–(21). Then is invertible,
and, with , , and ,
This is the NT analogue of (23): the NT block of the Schur complement matrix is a diagonal matrix plus a rank-one matrix.
Formalization Note Invertibility of is part of the conclusion because is Lean's Matrix.inv, which is on singular input. is written .
Preamble
import Mathlib import Definitions.Def_SDPT3_ScaleInv_Setting
Formal statement
namespace SDPT3.ScaleInv
open Matrix
theorem nt_eq_29 {k : ℕ} (x z : Fin (k + 1) → ℝ) (hx : socInt x) (hz : socInt z) :
IsUnit (GNT x z).det ∧ GNT x z *ᵥ x = (GNT x z)⁻¹ *ᵥ z ∧
(calE (GNT x z) z)⁻¹ * calF (GNT x z) x = (GNT x z)⁻¹ * (GNT x z)⁻¹ ∧
(GNT x z)⁻¹ * (GNT x z)⁻¹ =
(omegaNT x z ^ 2)⁻¹ • (J k + (2 : ℝ) • vecMulVec (Jbar k *ᵥ tNT x z) (Jbar k *ᵥ tNT x z)) := 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. 11, (29) and the sentence before it
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.