Skip to content
DraconiticResearch
Search Sources API
203,234 studies31 sourcesUpdated 51 min ago
PreprintCC BY 4.0arXiv

Spectrahedral relaxations and tightenings of rigidly convex sets

  • David Sawall
  • Markus Schweighofer
Open at sourcePDFDOICite

Abstract

We construct a natural spectrahedral relaxation of a rigidly convex set (rcs) that depends only on the cubic part and on the degree of the defining real zero polynomial. For quadratic polynomials, we prove exactness and for a product of linear polynomials, we show that a higher order version of our relaxation is exact. We also establish a way of tightening the relaxation by moving the origin inside the rcs, and that the rcs is recovered by sweeping the origin over its interior. To obtain all these results we use a linear form that is closely connected to the zeros of a given real zero polynomial. We also prove that any rcs can be written as an affine linear slice of the cone of non-negative polynomials. Using this, we can define a hierarchy of tightenings that are spectrahedral shadows. We can show that this tightening is exact if the given polynomial admits a determinantal representation. This tightening is similar to a tightening of a hyperbolicity cone due to Kummer, Plaumann, and Vinzant.

Related

  1. A Bilevel Market Equilibrium Model for Natural Gas Pipeline Network Operations: Convex Relaxations and Single-level Reformulations
    Novel Kumar Dey, Afrooz Jalilzadeh, Erfan Yazdandoost Hamedani +2
    arXivPreprintCC BY 4.0Full textOptimisation & controlarXiv
  2. Exact Convex Reformulations of Binary Quadratic Programs from Facially Reduced Semidefinite Relaxations
    Hao Hu, Mingming Xu
    arXivPreprintarXiv licenceFull textOptimisation & controlarXiv
  3. A HELLY-TYPE THEOREM FOR TWO-COMPONENT CONVEX SETS
    Giuliamaria Menara
    HALPreprintCC BY 4.0Full textGeneral mathematicsHAL
  4. Uniform Continuity of Boundary Crossing for Convex Sets
    Douglas S. Bridges
    arXivPreprintCC BY 4.0Full textAnalysis & PDEsarXiv
  5. Towards Hodge-Riemann relations for non-Archimedean analogs of valuations on convex sets
    Semyon Alesker
    arXivPreprintCC BY 4.0Full textGeometry & topologyarXiv

Cite

BibTeXRIS
BibTeX
@misc{sawall2026spectrahedral,
  title = {{Spectrahedral relaxations and tightenings of rigidly convex sets}},
  author = {David Sawall and Markus Schweighofer},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.37850},
  eprint = {2610.37850},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.37850},
  note = {CC BY 4.0},
}
RIS
TY  - UNPB
TI  - Spectrahedral relaxations and tightenings of rigidly convex sets
AU  - David Sawall
AU  - Markus Schweighofer
PY  - 2026
DA  - 2026/10/27
PB  - arXiv
DO  - 10.48550/arxiv.2610.37850
UR  - https://arxiv.org/abs/2610.37850
AB  - We construct a natural spectrahedral relaxation of a rigidly convex set (rcs) that depends only on the cubic part and on the degree of the defining real zero polynomial. For quadratic polynomials, we prove exactness and for a product of linear polynomials, we show that a higher order version of our relaxation is exact. We also establish a way of tightening the relaxation by moving the origin inside the rcs, and that the rcs is recovered by sweeping the origin over its interior. To obtain all these results we use a linear form that is closely connected to the zeros of a given real zero polynomial. We also prove that any rcs can be written as an affine linear slice of the cone of non-negative polynomials. Using this, we can define a hierarchy of tightenings that are spectrahedral shadows. We can show that this tightening is exact if the given polynomial admits a determinantal representation. This tightening is similar to a tightening of a hyperbolicity cone due to Kummer, Plaumann, and Vinzant.
ER  -