Pages that link to "Item:Q4689862"
From MaRDI portal
The following pages link to Improving the Semidefinite Programming Bound for the Kissing Number by Exploiting Polynomial Symmetry (Q4689862):
Displayed 11 items.
- Towards a proof of the 24-cell conjecture (Q722369) (← links)
- Semidefinite programming bounds for the average kissing number (Q2143250) (← links)
- Dimension reduction for semidefinite programs via Jordan algebras (Q2188241) (← links)
- Upper bounds for energies of spherical codes of given cardinality and separation (Q2200514) (← links)
- High-dimensional sphere packing and the modular bootstrap (Q2660222) (← links)
- Exact Semidefinite Programming Bounds for Packing Problems (Q4989941) (← links)
- Kissing number in non-Euclidean spaces of constant sectional curvature (Q4999491) (← links)
- A New Sequential Optimality Condition for Constrained Nonsmooth Optimization (Q5114399) (← links)
- Semidefinite programming bounds for binary codes from a split Terwilliger algebra (Q6074024) (← links)
- On the fulfillment of the complementary approximate Karush-Kuhn-Tucker conditions and algorithmic applications (Q6161552) (← links)
- Conic linear optimization for computer-assisted proofs. Abstracts from the workshop held April 10--16, 2022 (Q6170529) (← links)