Solving clustered low-rank semidefinite programs arising from polynomial optimization
From MaRDI portal
Recommendations
- Improving the Semidefinite Programming Bound for the Kissing Number by Exploiting Polynomial Symmetry
- Numerical study of semidefinite bounds for the k-cluster problem
- Loraine – an interior-point solver for low-rank semidefinite programming
- New upper bounds for kissing numbers from semidefinite programming
- A robust algorithm for semidefinite programming
Cites work
- A homogeneous interior-point algorithm for nonsymmetric convex conic optimization
- A note on the calculation of step-lengths in interior-point methods for semidefinite programming
- An algorithm for computing Fekete points in the triangle
- An Interior-Point Method for Semidefinite Programming
- Arb: Efficient Arbitrary-Precision Midpoint-Radius Interval Arithmetic
- Ausfüllung der Ebene durch Kreise
- Computing approximate Fekete points by QR factorizations of Vandermonde matrices
- CSDP, A C library for semidefinite programming
- Exact Semidefinite Programming Bounds for Packing Problems
- High-Accuracy Semidefinite Programming Bounds for Kissing Numbers
- scientific article; zbMATH DE number 47598 (Why is no real title available?)
- scientific article; zbMATH DE number 527343 (Why is no real title available?)
- scientific article; zbMATH DE number 2115093 (Why is no real title available?)
- Improving the Semidefinite Programming Bound for the Kissing Number by Exploiting Polynomial Symmetry
- Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices
- Julia: a fresh approach to numerical computing
- Matrix sum-of-squares relaxations for robust semi-definite programs
- Minimum of the energy potential of a point system of charges
- Moment methods in energy minimization: new bounds for Riesz minimal energy problems
- Nemo/Hecke. Computer algebra and number theory packages for the Julia programming language
- New upper bounds for kissing numbers from semidefinite programming
- New upper bounds for the density of translative packings of three-dimensional convex bodies with tetrahedral symmetry
- New upper bounds on sphere packings. I
- On Lattices Admitting Unique Lagrange Interpolations
- On the implementation and usage of SDPT3 -- a Matlab software package for semidefinite-quadratic-linear programming, version 4.0
- On the Implementation of a Primal-Dual Interior Point Method
- Pair correlation estimates for the zeros of the zeta function via semidefinite programming
- Primal--Dual Path-Following Algorithms for Semidefinite Programming
- Pure states, positive matrix polynomials and sums of Hermitian squares
- Spherical codes and designs
- Symmetry groups, semidefinite programs, and sums of squares
- The kissing number in four dimensions
- The sphere packing problem in dimension \(24\)
- The sphere packing problem in dimension 8
- Three-point bounds for energy minimization
- Upper bounds for packings of spheres of several radii
Cited in
(5)- The kissing number in 48 dimensions for codes with certain forbidden distances is 52 416 000
- Optimization hierarchies for distance-avoiding sets in compact spaces
- Bounding escape rates and approximating quasi-stationary distributions of Brownian dynamics
- Slow convergence of the moment-SOS hierarchy for an elementary polynomial optimization problem
- Getting to the root of the problem: sums of squares for limits of trees
This page was built for publication: Solving clustered low-rank semidefinite programs arising from polynomial optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6645951)
