Results 11 to 20 of about 53 (53)
On global optimization with indefinite quadratics
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 +1 more source
Two chromatic numbers, eigenvalues and a generalized Lovász theta
We show that Hoffman’s sum-of-eigenvalues bound for the chromatic number is sandwiched between the ceiling of the Lovász theta number of the complement (also known as the strict vector chromatic number) and the fractional chromatic number. In order to do
Carli Silva Marcel K. +2 more
doaj +1 more source
A spectral convex set is a collection of symmetric matrices whose range of eigenvalues forms a symmetric convex set. Spectral convex sets generalize the Schur-Horn orbitopes studied by Sanyal–Sottile–Sturmfels (2011). We study this class of convex bodies,
Raman Sanyal, James Saunderson
doaj +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
Disentangling orthogonal matrices. [PDF]
Zhang T, Singer A.
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
On the Convergence Analysis of the Optimized Gradient Method. [PDF]
Kim D, Fessler JA.
europepmc +1 more source

