Exploiting Group Symmetry in Truss Topology Optimization [PDF]
AMS classification: 90C22, 20Cxx, 70-08truss topology optimization;semidefinite programming;group ...
Bai, Y.Q. +3 more
core +1 more source
On Semidefinite Programming Relaxations of the Travelling Salesman Problem (Replaced by DP 2008-96) [PDF]
AMS classification: 90C22, 20Cxx, 70-08traveling salesman problem;semidefinite programming;quadratic as- signment ...
Klerk, E. de +2 more
core +1 more source
On Semidefinite Programming Relaxations of Association Schemes With Application to Combinatorial Optimization Problems [PDF]
AMS classification: 90C22, 20Cxx, 70-08traveling salesman problem;maximum bisection;semidefinite programming;association ...
Klerk, E. de, Pasechnik, D.V.
core +1 more source
New approximations for the cone of copositive matrices and its dual
We provide convergent hierarchies for the cone C of copositive matrices and its dual, the cone of completely positive matrices. In both cases the corresponding hierarchy consists of nested spectrahedra and provide outer (resp. inner) approximations for C
A Grundmann +16 more
core +5 more sources
On the Lovasz O-number of Almost Regular Graphs With Application to Erdos-Renyi Graphs [PDF]
AMS classifications: 05C69; 90C35; 90C22;Erdos-Renyi graph;stability number;Lovasz O-number;Schrijver O-number;C*-algebra;semidefinite ...
Klerk, E. de +3 more
core +1 more source
Exploiting Group Symmetry in Semidefinite Programming Relaxations of the Quadratic Assignment Problem [PDF]
We consider semidefinite programming relaxations of the quadratic assignment problem, and show how to exploit group symmetry in the problem data. Thus we are able to compute the best known lower bounds for several instances of quadratic assignment ...
Klerk, E. de, Sotirov, R.
core +1 more source
Noisy tensor completion via the sum-of-squares hierarchy. [PDF]
Barak B, Moitra A.
europepmc +1 more source
Facial reduction for symmetry reduced semidefinite and doubly nonnegative programs. [PDF]
Hu H, Sotirov R, Wolkowicz H.
europepmc +1 more source
A Relaxed Interior Point Method for Low-Rank Semidefinite Programming Problems with Applications to Matrix Completion. [PDF]
Bellavia S, Gondzio J, Porcelli M.
europepmc +1 more source
Complete positivity and distance-avoiding sets. [PDF]
DeCorte E, Filho FMO, Vallentin F.
europepmc +1 more source

