research
∙
12/03/2019
Polynomial time guarantees for the Burer-Monteiro method
The Burer-Monteiro method is one of the most widely used techniques for ...
share
research
∙
04/21/2019
A convex relaxation to compute the nearest structured rank deficient matrix
Given an affine space of matrices L and a matrix θ∈ L, consider the prob...
research
∙
02/04/2019
On the Complexity of Toric Ideals
We investigate the computational complexity of problems on toric ideals ...
research
∙
11/20/2018
Voronoi Cells of Varieties
Every real algebraic variety determines a Voronoi decomposition of its a...
research
∙
04/05/2018
The Geometry of SDP-Exactness in Quadratic Optimization
Consider the problem of minimizing a quadratic objective subject to quad...
research
∙
04/09/2016
