1 citations · 2 across the 6 of their papers we have counts for
7 papers
Quadratic Programming with Sparsity Constraints via Polynomial Roots
Kevin Shu
Quadratically constrained quadratic programs (QCQPs) are an expressive family of optimization problems that occur naturally in many applications. It is often of interest to seek ou…
On the computational equivalence of co-NP refutations of a matrix being a P-matrix
Spencer Gordon, Kevin Shu
A P-matrix is a square matrix such that all principal submatrices of have positive determinant. Such matrices appear naturally in instances of the linear complementarity pr…
Approximate PSD-Completion for Generalized Chordal Graphs
Kevin Shu
Recently, there has been interest in the question of whether a partial matrix in which many of the fully defined principal submatrices are PSD is approximately PSD completable. The…
Extreme Nonnegative Quadratics over Stanley Reisner Varieties
Kevin Shu
We consider the convex geometry of the cone of nonnegative quadratics over Stanley-Reisner varieties. Stanley-Reisner varieties (which are unions of coordinate planes) are amongst…
Causal Channels
Kevin Shu
We consider causal models with two observed variables and one latent variables, each variable being discrete, with the goal of characterizing the possible distributions on outcomes…
Hyperbolic Relaxation of -Locally Positive Semidefinite Matrices
Grigoriy Blekherman, Santanu S. Dey, Kevin Shu +1
A successful computational approach for solving large-scale positive semidefinite (PSD) programs is to enforce PSD-ness on only a collection of submatrices. For our study, we let $…