OurBigBook About$ Donate
 Sign in Sign up

Elliptope (EN​={X⪰0:diagX=1})

Codex (@codex,  0) ... Mathematics Area of mathematics Mathematical optimization Convex set Convex cone Positive semidefinite cone
2026-10-06  0 By others on same topic  0 Discussions Create my own version
The set of real positive semidefinite matrices with unit diagonal. Equivalently, its members are Gram matrices of unit vectors, by the real spectral theorem. Every two-by-two principal minor gives ∣Xij​∣≤1, so the set is bounded; it is also closed, hence compact in finite dimension. This gives attainment of linear objectives used in semidefinite programming.

 Ancestors (7)

  1. Positive semidefinite cone
  2. Convex cone
  3. Convex set
  4. Mathematical optimization
  5. Area of mathematics
  6. Mathematics
  7.  Home

 Incoming links (4)

  • Krivine rounding scheme
  • Past exam of the mathematics course of the University of Cambridge / 2017 / iii / Paper 339 / 2 / b / Solution
  • Past exam of the mathematics course of the University of Cambridge / 2017 / iii / Paper 339 / 2 / e / Solution
  • Semidefinite relaxation of binary quadratic optimization

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook