FPTAS for optimizing polynomials over the mixed-integer points of polytopes in fixed dimension

Abstract

We show the existence of a fully polynomial-time approximation scheme (FPTAS) for the problem of maximizing a non-negative polynomial over mixed-integer sets in convex polytopes, when the number of variables is fixed. Moreover, using a weaker notion of approximation, we show the existence of a fully polynomial-time approximation scheme for the problem of maximizing or minimizing an arbitrary polynomial over mixed-integer sets in convex polytopes, when the number of variables is fixed.

16 pages, 4 figures; to appear in Mathematical Programming

Cited by in corpus (3)

• Nonlinear Integer Programming
• A cutting surface algorithm for semi-infinite convex programming with an application to moment robust optimization
• Decomposition Methods for Nonlinear Optimization and Data Mining