Approximation Algorithms for Discrete Polynomial Optimization

Simai He, Zhening Li, Shuzhong Zhang

Research output: Contribution to journalArticlepeer-review

16 Scopus citations

Abstract

In this paper, we consider approximation algorithms for optimizing a generic multivariate polynomial function in discrete (typically binary) variables. Such models have natural applications in graph theory, neural networks, error-correcting codes, among many others. In particular, we focus on three types of optimization models: (1) maximizing a homogeneous polynomial function in binary variables; (2) maximizing a homogeneous polynomial function in binary variables, mixed with variables under spherical constraints; (3) maximizing an inhomogeneous polynomial function in binary variables. We propose polynomial-time randomized approximation algorithms for such polynomial optimization models, and establish the approximation ratios (or relative approximation ratios whenever appropriate) for the proposed algorithms. Some examples of applications for these models and algorithms are discussed as well.

Original languageEnglish (US)
Pages (from-to)3-36
Number of pages34
JournalJournal of the Operations Research Society of China
Volume1
Issue number1
DOIs
StatePublished - Jan 1 2013

Keywords

  • Approximation algorithm
  • Approximation ratio
  • Binary integer programming
  • Mixed integer programming
  • Polynomial optimization problem

Fingerprint Dive into the research topics of 'Approximation Algorithms for Discrete Polynomial Optimization'. Together they form a unique fingerprint.

Cite this