Approximating the maximum of a polynomial over a polytope: Handelman decomposition and continuous generating functions
Skip to main content
eScholarship
Open Access Publications from the University of California

Approximating the maximum of a polynomial over a polytope: Handelman decomposition and continuous generating functions

  • Author(s): De Loera, Jesús
  • Dutra, Brandon
  • Köppe, Matthias
  • et al.

Published Web Location

https://arxiv.org/pdf/1601.04118.pdf
No data is associated with this publication.
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.

Item not freely available? Link broken?
Report a problem accessing this item