this talk discusses 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.