Pages that link to "Item:Q4989941"
From MaRDI portal
The following pages link to Exact Semidefinite Programming Bounds for Packing Problems (Q4989941):
Displaying 9 items.
- Semidefinite programming bounds for the average kissing number (Q2143250) (← links)
- Fast First-Order Algorithms for Packing–Covering Semidefinite Programs (Q3454972) (← links)
- Lower Bounds on the Lattice-Free Rank for Packing and Covering Integer Programs (Q4646443) (← links)
- Kissing number in non-Euclidean spaces of constant sectional curvature (Q4999491) (← links)
- Dual Certificates and Efficient Rational Sum-of-Squares Decompositions for Polynomial Optimization over Compact Sets (Q5043282) (← links)
- \(\ell_1\)-sparsity approximation bounds for packing integer programs (Q5918913) (← links)
- The smallest mono-unstable convex polyhedron with point masses has 8 faces and 11 vertices (Q6113351) (← links)
- Conic linear optimization for computer-assisted proofs. Abstracts from the workshop held April 10--16, 2022 (Q6170529) (← links)
- Solving clustered low-rank semidefinite programs arising from polynomial optimization (Q6645951) (← links)