Jordan symmetry reduction for conic optimization over the doubly nonnegative cone: theory and software

DOI10.1080/10556788.2021.2022146MaRDI QIDQ5058403OpenAlexFDO

Authors Daniel Brosch, E. de Klerk

Publication date 20 December 2022

Published in Optimization Methods \& Software (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2001.11348

zbMATH Keywords

quadratic assignment problemsemidefinite programmingsymmetry reductionmaximum stable set

Mathematics Subject Classification ID

Semidefinite programming (90C22) Discrete location and assignment (90B80) Polynomial optimization (90C23)

Recommendations

• Jordan-algebraic aspects of nonconvex optimization over symmetric cones
• Jacobian nonsingularity in nonlinear symmetric conic programming problems and its application
• Towards non-symmetric conic optimization
• Non-differentiable symmetric duality for multiobjective programming with cone constraints
• scientific article; zbMATH DE number 7352423
• Equivalent conditions for Jacobian nonsingularity in linear symmetric cone programming
• A primal-dual symmetric relaxation for homogeneous conic systems
• Nondifferentiable multiobjective symmetric dual programs over cones
• Higher-order symmetric duality in nondifferentiable multiobjective optimization over cones
• Generalised convexity and symmetric duality in nonlinear programming

Cites work

• scientific article; zbMATH DE number 715155 (Why is no real title available?)
• scientific article; zbMATH DE number 1981748 (Why is no real title available?)
• scientific article; zbMATH DE number 2111135 (Why is no real title available?)
• A comparison of the Delsarte and Lovász bounds
• 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
• Copositive and semidefinite relaxations of the quadratic assignment problem
• Dimension reduction for semidefinite programs via Jordan algebras
• Eigenvalue bounds for independent sets
• Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem
• Improved semidefinite programming bounds for quadratic assignment problems with suitable symmetry
• Invariant Semidefinite Programs
• Jordan schemes
• Minimum energy configurations on a toric lattice as a quadratic assignment problem
• Numerical block diagonalization of matrix \(\ast\)-algebras with application to semidefinite programming
• On the Lovász \(\vartheta\)-number of almost regular graphs with application to Erdős-Rényi graphs
• Pre- and Post-Processing Sum-of-Squares Programs in Practice
• QAPLIB - a quadratic assignment problem library
• Semidefinite programming relaxations for the quadratic assignment problem

Cited in

(6)

• Construction of Multivariate Polynomial Approximation Kernels via Semidefinite Programming
• Facial reduction for symmetry reduced semidefinite and doubly nonnegative programs
• Numerical reduction method for doubly nonnegative optimization problems
• Dimension reduction for semidefinite programs via Jordan algebras
• SDPSymmetryReduction.jl
• Jordan-algebraic aspects of nonconvex optimization over symmetric cones

Describes a project that uses

Uses Software

• QAPLIB
• Julia

This page was built for publication: Jordan symmetry reduction for conic optimization over the doubly nonnegative cone: theory and software

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5058403)