Exploiting symmetry in copositive programs via semidefinite hierarchies
From MaRDI portal
Publication:2349140
DOI10.1007/s10107-015-0879-0zbMath1328.90110OpenAlexW2043979816MaRDI QIDQ2349140
Publication date: 19 June 2015
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-015-0879-0
Related Items (7)
Symmetry Reduction in AM/GM-Based Optimization ⋮ Dimension reduction for semidefinite programs via Jordan algebras ⋮ Conic optimization: a survey with special focus on copositive optimization and binary quadratic problems ⋮ Globally Solving Nonconvex Quadratic Programs via Linear Integer Programming Techniques ⋮ Orbital geometry and group majorisation in optimisation ⋮ A Complete Semidefinite Algorithm for Detecting Copositive Matrices and Tensors ⋮ New bounds for truthful scheduling on two unrelated selfish machines
Uses Software
Cites Work
- Solving semidefinite-quadratic-linear programs using SDPT3
- Symmetry in RLT-type relaxations for the quadratic assignment and standard quadratic optimization problems
- An improved algorithm to test copositivity
- A numerical algorithm for block-diagonal decomposition of matrix \(*\)-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
- Strengthened semidefinite programming bounds for codes
- Reduction of symmetric semidefinite programs using the regular \(\ast\)-representation
- Symmetry in semidefinite programs
- Exploiting group symmetry in truss topology optimization
- Completely positive reformulations for polynomial optimization
- A PTAS for the minimization of polynomials of fixed degree over the simplex
- Copositivity cuts for improving SDP bounds on the clique number
- Global Optimization with Polynomials and the Problem of Moments
- Approximation of the Stability Number of a Graph via Copositive Programming
- Mixed 0-1 Linear Programs Under Objective Uncertainty: A Completely Positive Representation
- New Code Upper Bounds From the Terwilliger Algebra and Semidefinite Programming
- High-Accuracy Semidefinite Programming Bounds for Kissing Numbers
- On Semidefinite Programming Relaxations of the Traveling Salesman Problem
- A comparison of the Delsarte and Lovász bounds
- Cyclic‐order graphs and Zarankiewicz's crossing‐number conjecture
- Copositive realxation for genera quadratic programming
- Exploiting Symmetries in SDP-Relaxations for Polynomial Optimization
- Computing the Stability Number of a Graph Via Linear and Semidefinite Programming
- A Copositive Programming Approach to Graph Partitioning
- LMI Approximations for Cones of Positive Semidefinite Forms
- On a problem of P. Turan concerning graphs
- Worst-case CVaR based portfolio optimization models with applications to scenario planning
This page was built for publication: Exploiting symmetry in copositive programs via semidefinite hierarchies
