1 citations · 1 across the 2 of their papers we have counts for
2 papers
math.OC2022★ 1 cited
The Burer-Monteiro SDP method can fail even above the Barvinok-Pataki bound
Liam O'Carroll, Vaidehi Srinivas, Aravindan Vijayaraghavan
The most widely used technique for solving large-scale semidefinite programs (SDPs) in practice is the non-convex Burer-Monteiro method, which explicitly maintains a low-rank SDP s…
math.AC2012
The primary components of positive critical binomial ideals
Liam O'Carroll, Francesc Planas-Vilanova
A natural candidate for a generating set of the (necessarily prime) defining ideal of an -dimensional monomial curve, when the ideal is an almost complete intersection, is a ful…