64 citations · 414 across the 34 of their papers we have counts for
Showing 2020Show all
2 papers · 1 filter
math.NA2020
Rigid continuation paths II. Structured polynomial systems
Peter Bürgisser, Felipe Cucker, Pierre Lairez
This work studies the average complexity of solving structured polynomial systems that are characterized by a low evaluation cost, as opposed to the dense random model previously u…
math.OC2020★ 7 cited
Interior-point methods for unconstrained geometric programming and scaling problems
Peter Bürgisser, Yinan Li, Harold Nieuwboer +1
We provide a condition-based analysis of two interior-point methods for unconstrained geometric programs, a class of convex programs that arise naturally in applications including…