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

2006-09-01

Theoretical Computer Science , Volume 361 - Issue 2-3 p. 210- 225

Additional Metadata
Keywords	Semidefinite programming, Global optimization, Positive polynomial, Sum of squares of polynomials, Approximation algorithm
MSC	Semidefinite programming (msc 90C22), Nonconvex programming, global optimization (msc 90C26), Methods of relaxation type (msc 49M20)
THEME	Logistics (theme 3)
Publisher	Elsevier
Journal	Theoretical Computer Science
Project	Semidefinite programming and combinatorial optimization
Organisation	Networks and Optimization
Citation APA Style AAA Style APA Style Cell Style Chicago Style Harvard Style IEEE Style MLA Style Nature Style Vancouver Style American-Institute-of-Physics Style Council-of-Science-Editors Style BibTex Format Endnote Format RIS Format CSL Format DOIs only Format	de Klerk, E., Laurent, M., & Parrilo, P. (2006). A PTAS for the minimization of polynomials of fixed degree over the simplex. Theoretical Computer Science, 361(2-3), 210–225.

Additional Files
Fulltext Final Version
Publisher Version

Publication