13 citations · 19 across the 17 of their papers we have counts for
Showing math.OCShow all
2 papers · 1 filter
math.OC2023★ 1 cited
A polyhedral homotopy algorithm for computing critical points of polynomial programs
Julia Lindberg, Leonid Monin, Kemal Rose
In this paper we propose a method that uses Lagrange multipliers and numerical algebraic geometry to find all critical points, and therefore globally solve, polynomial optimization…
math.OC2022
Invariants of SDP exactness in quadratic programming
Julia Lindberg, Jose Rodriguez
In this paper we study the Shor relaxation of quadratic programs by fixing a feasible set and considering the space of objective functions for which the Shor relaxation is exact. W…