A PTAS for the minimization of polynomials of fixed degree over the simplex

  title={A PTAS for the minimization of polynomials of fixed degree over the simplex},
  author={Etienne de Klerk and Monique Laurent and Pablo A. Parrilo},
  journal={Theor. Comput. Sci.},
One may assume w.l.o.g. that p(x) is a homogeneous polynomial (form). Indeed, as observed in [2], if p(x) = ∑d l=0 pl(x), where pl(x) is homogeneous of degree l, then minimizing p(x) over ∆ is equivalent to minimizing the degree d form p(x) := ∑d l=0 pl(x)( ∑n i=1 xi) . Problem (1) is an NP-hard problem, already for forms of degree d = 2, as it contains the maximum stable set problem. Indeed, for a graph G with adjacency matrix A, the maximum size α(G) of a stable set in G can be expressed as 1… CONTINUE READING

From This Paper

Topics from this paper.
44 Citations
19 References
Similar Papers


Publications citing this paper.
Showing 1-10 of 44 extracted citations


Publications referenced by this paper.
Showing 1-10 of 19 references

Random walk in a simplex and quadratic optimization over convex polytopes

  • Yu. Nesterov
  • CORE Discussion Paper 2003/71,
  • 2003
Highly Influential
3 Excerpts

A new bound for Pólya’s theorem with applications to polynomials positive on polyhedra

  • V. Powers, B. Reznick
  • Journal of Pure and Applied Algebra,
  • 2001
Highly Influential
4 Excerpts

Global optimization of homogeneous polynomials on the simplex and on the sphere

  • L. Faybusovich
  • Frontiers in Global Optimization. Kluwer Academic…
  • 2003
1 Excerpt

Semidefinite programming relaxations of nonconvex quadratic optimization

  • H. Wolkowicz
  • 2000

Similar Papers

Loading similar papers…