Jordan symmetry reduction for conic optimization over the doubly nonnegative cone: theory and software
From MaRDI portal
Publication:5058403
DOI10.1080/10556788.2021.2022146OpenAlexW3107535351MaRDI QIDQ5058403
Daniel Brosch, Etienne de Klerk
Publication date: 20 December 2022
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2001.11348
Semidefinite programming (90C22) Discrete location and assignment (90B80) Polynomial optimization (90C23)
Related Items
SDPSymmetryReduction.jl, Construction of Multivariate Polynomial Approximation Kernels via Semidefinite Programming
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Improved semidefinite programming bounds for quadratic assignment problems with suitable symmetry
- A numerical algorithm for block-diagonal decomposition of matrix \(*\)-algebras with application to semidefinite programming
- A numerical algorithm for block-diagonal decomposition of matrix \(*\)-algebras with general irreducible components
- Numerical block diagonalization of matrix \(\ast\)-algebras with application to semidefinite programming
- Copositive and semidefinite relaxations of the quadratic assignment problem
- Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem
- Eigenvalue bounds for independent sets
- On the Lovász \(\vartheta\)-number of almost regular graphs with application to Erdős-Rényi graphs
- QAPLIB - a quadratic assignment problem library
- Semidefinite programming relaxations for the quadratic assignment problem
- Jordan schemes
- Dimension reduction for semidefinite programs via Jordan algebras
- Minimum energy configurations on a toric lattice as a quadratic assignment problem
- Invariant Semidefinite Programs
- A comparison of the Delsarte and Lovász bounds
- Pre- and Post-Processing Sum-of-Squares Programs in Practice
