BIRS Workshop Lecture Videos

Banff International Research Station Logo

BIRS Workshop Lecture Videos

The Saddle Point Problem of Polynomials Nie, Jiawang


This paper studies the saddle point problem of polynomials. We give an algorithm for computing saddle points, based on Lasserre's hierarchy of Moment-SOS relaxations. Under some genericity assumptions, we show that: i) if there exists a saddle point, the algorithm can get one by solving a finite number of relaxations; ii) if there is no saddle point, the algorithm can detect its nonexistence.

Item Media

Item Citations and Data


Attribution-NonCommercial-NoDerivatives 4.0 International