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…