183 research outputs found
Stable-Set and Coloring bounds based on 0-1 quadratic optimization
We consider semidefinite relaxations of Stable-Set and Coloring, which are
based on quadratic 0-1 optimization. Information about the stability number and
the chromatic number is hidden in the objective function. This leads to
simplified relaxations which depend mostly on the number of vertices of the
graph. We also propose tightenings of the relaxations which are based on the
maximal cliques of the underlying graph. Computational results on graphs from
the literature show the strong potential of this new approach
New bounds for the max--cut and chromatic number of a graph
We consider several semidefinite programming relaxations for the max--cut
problem, with increasing complexity. The optimal solution of the weakest
presented semidefinite programming relaxation has a closed form expression that
includes the largest Laplacian eigenvalue of the graph under consideration.
This is the first known eigenvalue bound for the max--cut when that is
applicable to any graph. This bound is exploited to derive a new eigenvalue
bound on the chromatic number of a graph. For regular graphs, the new bound on
the chromatic number is the same as the well-known Hoffman bound; however, the
two bounds are incomparable in general. We prove that the eigenvalue bound for
the max--cut is tight for several classes of graphs. We investigate the
presented bounds for specific classes of graphs, such as walk-regular graphs,
strongly regular graphs, and graphs from the Hamming association scheme
Ellipsoidal relaxations of the stable set problem:theory and algorithms
A new exact approach to the stable set problem is presented, which attempts to avoid the pitfalls of existing approaches based on linear and semidefinite programming. The method begins by constructing an ellipsoid that contains the stable set polytope and has the property that the upper bound obtained by optimising over it is equal to the Lovasz theta number. This ellipsoid can then be used to construct useful convex relaxations of the stable set problem, which can be embedded within a branch-and-bound framework. Extensive computational results are given, which indicate the potential of the approach
Exploiting ideal-sparsity in the generalized moment problem with application to matrix factorization ranks
We explore a new type of sparsity for the generalized moment problem (GMP)
that we call ideal-sparsity. This sparsity exploits the presence of equality
constraints requiring the measure to be supported on the variety of an ideal
generated by bilinear monomials modeled by an associated graph. We show that
this enables an equivalent sparse reformulation of the GMP, where the single
(high dimensional) measure variable is replaced by several (lower-dimensional)
measure variables supported on the maximal cliques of the graph. We explore the
resulting hierarchies of moment-based relaxations for the original dense
formulation of GMP and this new, equivalent ideal-sparse reformulation, when
applied to the problem of bounding nonnegative- and completely positive matrix
factorization ranks. We show that the ideal-sparse hierarchies provide bounds
that are at least as good (and often tighter) as those obtained from the dense
hierarchy. This is in sharp contrast to the situation when exploiting
correlative sparsity, as is most common in the literature, where the resulting
bounds are weaker than the dense bounds. Moreover, while correlative sparsity
requires the underlying graph to be chordal, no such assumption is needed for
ideal-sparsity. Numerical results show that the ideal-sparse bounds are often
tighter and much faster to compute than their dense analogs.Comment: 36 pages, 3 figure
- …