3 citations · 4 across the 4 of their papers we have counts for
Showing 2013Show all
3 papers · 1 filter
math.OC2013
A refined error analysis for fixed-degree polynomial optimization over the simplex
Zhao Sun
We consider the problem of minimizing a fixed-degree polynomial over the standard simplex. This problem is well known to be NP-hard, since it contains the maximum stable set proble…
math.OC2013
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…
math.OC2013
Handelman's hierarchy for the maximum stable set problem
Monique Laurent, Zhao Sun
The maximum stable set problem is a well-known NP-hard problem in combinatorial optimization, which can be formulated as the maximization of a quadratic square-free polynomial over…