1 citations · 2 across the 8 of their papers we have counts for
4 papers · 1 filter
Lagrangian Dual Sections: A Topological Perspective on Hidden Convexity
Venkat Chandrasekaran, Timothy Duff, Jose Israel Rodriguez +1
Hidden convexity is a powerful idea in optimization: under the right transformations, nonconvex problems that are seemingly intractable can be solved efficiently using convex optim…
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…
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…
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 $…