The authors generalize t-semidefinite programming to any orthogonal transform M and characterize group-equivariant tensor multiplications via Schur's Lemma.
Pre- and Post-Processing Sum-of-Squares Programs in Practice
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Tensor-Tensor Products, Group Representations, and Semidefinite Programming
The authors generalize t-semidefinite programming to any orthogonal transform M and characterize group-equivariant tensor multiplications via Schur's Lemma.