Approximating the maximum of a polynomial over a polytope: Handelman decomposition and continuous generating functions
classification
🧮 math.OC
keywords
polynomialcontinuousdecompositionfunctionsgeneratinghandelmanmaximumapproximate
read the original abstract
We investigate a way to approximate the maximum of a polynomial over a polytopal region by using Handelman's polynomial decomposition and continuous multivariate generating functions. The maximization problem is NP-hard, but our approximation methods will run in polynomial time when the dimension is fixed.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.