On global optimization with indefinite quadratics
EURO Journal on Computational Optimization, 2017 We present an algorithmic framework for global optimization problems in which the non-convexity is manifested as an indefinite-quadratic as part of the objective function.
Marcia Fampa, Jon Lee, Wendel Melo
doaj
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 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
Support-based lower bounds for the positive semidefinite rank of a nonnegative matrix [PDF]
, 2013 The positive semidefinite rank of a nonnegative $(m\times n)$-matrix~$S$ is the minimum number~$q$ such that there exist positive semidefinite $(q\times q)$-matrices $A_1,\dots,A_m$, $B_1,\dots,B_n$ such that $S(k,\ell) = \mbox{tr}(A_k^* B_\ell)$.
Dirk, Oliver Theis, Troy Lee
core
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
Bounding the support of a measure from its marginal moments
, 2010 Given all moments of the marginals of a measure on Rn, one provides (a) explicit bounds on its support and (b), a numerical scheme to compute the smallest box that contains the support.
Lasserre, Jean
core +2 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
Using a Factored Dual in Augmented Lagrangian Methods for Semidefinite Programming
, 2018 In the context of augmented Lagrangian approaches for solving semidefinite programming problems, we investigate the possibility of eliminating the positive semidefinite constraint on the dual matrix by employing a factorization. Hints on how to deal with
De Santis, Marianna +2 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
Approximations of convex bodies by polytopes and by projections of spectrahedra [PDF]
, 2012 We prove that for any compact set B in R^d and for any epsilon >0 there is a finite subset X of B of |X|=d^{O(1/epsilon^2)} points such that the maximum absolute value of any linear function ell: R^d --> R on X approximates the maximum absolute value of ...
Barvinok, Alexander
core +1 more source