p. 9 — Kq = {x : xᵀQx ≥ 0, x₁ ≥ 0} and Kr = {x : xᵀQx ≥ 0, x₁, x₂ ≥ 0}
ProvedConicQuadIPM.Complementarity.alt_descriptionconic-optimizationp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1second-order-cone
The matrices of Definition 3.2 give an alternative description of the two quadratic cones. For every ,
where ; and if ,
where is the matrix (19).
This is the form in which the cone constraints enter the neighbourhood and the scaling of §3.2.
Formalization Note. are indices 0, 1. The rotated case carries , the dimension the definition of needs.
Preamble
import Mathlib import Definitions.Def_ConicQuadIPM_Complementarity_Setting open Matrix
Formal statement
namespace ConicQuadIPM.Complementarity
theorem alt_description (d : ℕ) (v : Fin d → ℝ) :
(inQuad v ↔ 0 ≤ v ⬝ᵥ (Qmat .quad d *ᵥ v) ∧ 0 ≤ coord v 0) ∧
(2 ≤ d → (inRot v ↔
0 ≤ v ⬝ᵥ (Qmat .rot d *ᵥ v) ∧ 0 ≤ coord v 0 ∧ 0 ≤ coord v 1)) := by sorry
end ConicQuadIPM.Complementarity
Source
Andersen, Roos & Terlaky, On implementing a primal-dual interior-point method for conic quadratic optimization, Math. Program. (2003); authors' preprint of 18 Dec 2000, p. 9, second paragraph
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.