An alternative proof of a PTAS for fixed-degree polynomial optimization over the simplex

Etienne de Klerk, Monique Laurent, Zhao Sun

The problem of minimizing a polynomial over the standard simplex is one of the basic NP-hard nonlinear optimization problems --- it contains the maximum clique problem in graphs as…