Results 31 to 40 of about 91 (79)
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
On Some Properties of Interior Methods for Optimization
, 2003 This thesis consists of four independent papers concerningdifferent aspects of interior methods for optimization. Threeof the papers focus on theoretical aspects while the fourth oneconcerns some computational experiments. The systems of equations solved
Sporre, Göran
core +2 more sources
Facial reduction for symmetry reduced semidefinite and doubly nonnegative programs. [PDF]
Math Program, 2023 Hu H, Sotirov R, Wolkowicz H.
europepmc +1 more source
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
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
We propose a convex quadratic programming (CQP) relaxation for multi-ball constrained quadratic optimization (MB). (CQP) is shown to be equivalent to semidefinite programming relaxation in the hard case.
Zhuoyi Xu, Yong Xia, Jiulin Wang
core +1 more source
A Relaxed Interior Point Method for Low-Rank Semidefinite Programming Problems with Applications to Matrix Completion. [PDF]
J Sci Comput, 2021 Bellavia S, Gondzio J, Porcelli M.
europepmc +1 more source
Basc: Constrained Approximation by Semidefinite Programming
, 2016 This article details the theoretical grounds for a semidefinite-programming-based method that computes best approximants by splines under some general constraints and relative to several function norms, notably the max-norm.
Vladlena Powers, Simon Foucart
core
, 2006 . We present a new semidefinite programming formulation of sum-of-squares representations of nonnegative polynomials, cosine polynomials and trigonometric polynomials of one variable. The parametrization is based on discrete transforms (specifically, the
Tae Roh, Lieven Vandenberghe
core
Mathematisches Forschungsinstitut Oberwolfach Report No. 50/2005 Combinatorial Optimization
, 2005 . This report summarizes the meeting on Combinatorial Optimization where new and promising developments in the field were discussed. The lectures show the many connections to other branches in Mathematics, like Combinatorics, Graph Theory, Geometry and ...
Uwe Zimmermann (braunschweig +2 more
core