What is it about?
Provides a sequence of upper bounds that converges to the global minimum. Computing such bounds requires only finitely many elementary calculations.
Featured Image
Read the Original
This page is a summary of: Bound-Constrained Polynomial Optimization Using Only Elementary Calculations, Mathematics of Operations Research, March 2017, INFORMS,
DOI: 10.1287/moor.2016.0829.
You can read the full text:
Contributors
The following have contributed to this page
