Results 41 to 50 of about 585 (68)
Fourier analysis on finite groups and the Lov\'asz theta-number of Cayley graphs
We apply Fourier analysis on finite groups to obtain simplified formulations for the Lov\'asz theta-number of a Cayley graph. We put these formulations to use by checking a few cases of a conjecture of Ellis, Friedgut, and Pilpel made in a recent article
de Laat, David+2 more
core +1 more source
Noisy tensor completion via the sum-of-squares hierarchy. [PDF]
Barak B, Moitra A.
europepmc +1 more source
A Note on the Stability Number of an Orthogonality Graph [PDF]
We consider the orthogonality graph (n) with 2n vertices corresponding to the vectors {0, 1}n, two vertices adjacent if and only if the Hamming distance between them is n/2.We show that, for n = 16, the stability number of (n) is ( (16)) = 2304, thus ...
Klerk, E. de, Pasechnik, D.V.
core +1 more source
Facial reduction for symmetry reduced semidefinite and doubly nonnegative programs. [PDF]
Hu H, Sotirov R, Wolkowicz H.
europepmc +1 more source
Exposed faces of semidefinitely representable sets
A linear matrix inequality (LMI) is a condition stating that a symmetric matrix whose entries are affine linear combinations of variables is positive semidefinite.
Netzer, Tim+2 more
core +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
A computational study of exact subgraph based SDP bounds for Max-Cut, stable set and coloring. [PDF]
Gaar E, Rendl F.
europepmc +1 more source
Disentangling orthogonal matrices. [PDF]
Zhang T, Singer A.
europepmc +1 more source
On the Convergence Analysis of the Optimized Gradient Method. [PDF]
Kim D, Fessler JA.
europepmc +1 more source