Integrality of Linearizations of Polynomials over Binary Variables using Additional Monomials

11/15/2019
by   Christopher Hojny, et al.
0

Polynomial optimization problems over binary variables can be expressed as integer programs using a linearization with extra monomials in addition to those arising in the given polynomial. We characterize when such a linearization yields an integral relaxation polytope, generalizing work by Del Pia and Khajavirad (SIAM Journal on Optimization, 2018). We also present an algorithm that finds these extra monomials for a given polynomial to yield an integral relaxation polytope or determines that no such set of extra monomials exists. In the former case, our approach yields an algorithm to solve the given polynomial optimization problem as a compact LP, and we complement this with a purely combinatorial algorithm.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/04/2020

Separating Variables in Bivariate Polynomial Ideals

We present an algorithm which for any given ideal I⊆𝕂 [x,y] finds all el...
research
05/30/2023

Global minimization of polynomial integral functionals

We describe a `discretize-then-relax' strategy to globally minimize inte...
research
02/18/2020

N-fold integer programming via LP rounding

We consider N-fold integer programming problems. After a decade of conti...
research
02/19/2021

Fair Sparse Regression with Clustering: An Invex Relaxation for a Combinatorial Problem

In this paper, we study the problem of fair sparse regression on a biase...
research
04/16/2023

On modeling NP-Complete problems as polynomial-sized linear programs: Escaping/Side-stepping the "barriers"

In view of the extended formulations (EFs) developments (e.g. "Fiorini, ...
research
05/04/2015

Higher Order Maximum Persistency and Comparison Theorems

We address combinatorial problems that can be formulated as minimization...

Please sign up or login with your details

Forgot password? Click here to reset