Bound-constrained polynomial optimization using only elementary calculations

2017-08-01

Mathematics of Operations Research , Volume 42 - Issue 3 p. 834- 853

Additional Metadata
Keywords	Bound-constrained optimization, Lasserre hierarchy, Polynomial optimization
Stakeholder	Symetrics B.V., Amsterdam
Persistent URL	doi.org/10.1287/moor.2016.0829
Journal	Mathematics of Operations Research
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., Lasserre, J. B., Laurent, M., & Sun, Z. (2017). Bound-constrained polynomial optimization using only elementary calculations. Mathematics of Operations Research, 42(3), 834–853. doi:10.1287/moor.2016.0829

Publication