FPTAS for mixed-integer polynomial optimization with a fixed number of variables
Jesús A. De Loera, Raymond Hemmecke, Matthias Köppe, Robert Weismantel
Abstract
We show the existence of an FPTAS for the problem of maximizing a non-negative polynomial over mixed-integer sets in convex polytopes, when the number of variables is fixed.
Create a lesson
Related papers
Risk-Sensitive Stochastic Optimal Control on Positive Cones
Mohamad Al Ahdab, John-Josef Leth
Deterministic Oracle Complexity for Goldstein Stationarity in Nonsmooth Nonconvex Optimization with Constraints
Yixi Ding, Ya-xiang Yuan
Technical Report: Partially Asynchronous Distributed Optimization on Riemannian Manifolds
Adam Pooley, William Warke, Matthew T. Hale
Multi-Step Performance Estimation for Gradient Descent under the Polyak Lojasiewicz Condition
Wanli Hong, Shuyang Ling
Robust Markov Decision Processes: An Introduction Using Convex Optimization and Game Theory
Julien Grand-Clément
Dual-Mode Extremum Seeking for Diffusion Systems with Boundary-Cost Feedback
Martin Guay, Denis Dochain