Solving clustered low-rank semidefinite programs arising from polynomial optimization
DOI10.1007/S12532-024-00264-WMaRDI QIDQ6645951FDOQ6645951
Authors: Nando Leijenhorst, David de Laat 
Publication date: 29 November 2024
Published in: Mathematical Programming Computation (Search for Journal in Brave)
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
semidefinite programmingsymmetry reductionpacking problemssum-of-squares polynomialsprimal-dual interior point methodlow-rank constraints
Semidefinite programming (90C22) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04) Polynomial optimization (90C23)
Cites Work
- CSDP, A C library for semidefinite programming
- Julia: a fresh approach to numerical computing
- On the Implementation of a Primal-Dual Interior Point Method
- Title not available (Why is that?)
- Symmetry groups, semidefinite programs, and sums of squares
- Matrix sum-of-squares relaxations for robust semi-definite programs
- On the implementation and usage of SDPT3 -- a Matlab software package for semidefinite-quadratic-linear programming, version 4.0
- Minimum of the energy potential of a point system of charges
- Title not available (Why is that?)
- Primal--Dual Path-Following Algorithms for Semidefinite Programming
- An Interior-Point Method for Semidefinite Programming
- Three-point bounds for energy minimization
- Spherical codes and designs
- Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices
- Computing approximate Fekete points by QR factorizations of Vandermonde matrices
- A homogeneous interior-point algorithm for nonsymmetric convex conic optimization
- An algorithm for computing Fekete points in the triangle
- New upper bounds on sphere packings. I
- The sphere packing problem in dimension \(24\)
- On Lattices Admitting Unique Lagrange Interpolations
- A note on the calculation of step-lengths in interior-point methods for semidefinite programming
- New upper bounds for kissing numbers from semidefinite programming
- Title not available (Why is that?)
- Upper bounds for packings of spheres of several radii
- The kissing number in four dimensions
- Pure states, positive matrix polynomials and sums of Hermitian squares
- High-Accuracy Semidefinite Programming Bounds for Kissing Numbers
- The sphere packing problem in dimension 8
- Improving the Semidefinite Programming Bound for the Kissing Number by Exploiting Polynomial Symmetry
- Arb: Efficient Arbitrary-Precision Midpoint-Radius Interval Arithmetic
- Ausfüllung der Ebene durch Kreise
- Nemo/Hecke. Computer algebra and number theory packages for the Julia programming language
- Exact Semidefinite Programming Bounds for Packing Problems
- New upper bounds for the density of translative packings of three-dimensional convex bodies with tetrahedral symmetry
- Moment methods in energy minimization: new bounds for Riesz minimal energy problems
- Pair correlation estimates for the zeros of the zeta function via semidefinite programming
Cited In (1)
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)
