most citedSparse PSD approximation of the PSD cone

2 citations · 2 across the 1 of their papers we have counts for

collaborators

2 papers

math.OC2020

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 $…

math.OC2020★ 2 cited

Sparse PSD approximation of the PSD cone

Grigoriy Blekherman, Santanu S. Dey, Marco Molinaro +1

While semidefinite programming (SDP) problems are polynomially solvable in theory, it is often difficult to solve large SDP instances in practice. One technique to address this iss…