Optimization Online


Error bounds for monomial convexification in polynomial optimization

Warren Adams (wadams***at***clemson.edu)
Akshay Gupte (agupte***at***clemson.edu)
Yibo Xu (yibox***at***clemson.edu)

Abstract: Convex hulls of monomials have been widely studied in the literature, and monomial convexifications are implemented in global optimization software for relaxing polynomials. However, there has been no study of the error in the global optimum from such approaches. We give bounds on the worst-case error for convexifying a monomial over subsets of $[0,1]^n$. This implies additive error bounds for relaxing a polynomial optimization problem by convexifying each monomial separately. Our main error bounds depend primarily on the degree of the monomial, making them easy to compute. Since monomial convexification studies depend on the bounds on the associated variables, in the second part, we conduct an error analysis for a multilinear monomial over two different types of box constraints. As part of this analysis, we also derive the convex hull of a multilinear monomial over $[-1,1]^n$.

Keywords: Polynomial optimization, Monomial, Multilinear, Convex hull, Error analysis, Means inequality

Category 1: Global Optimization (Theory )

Category 2: Integer Programming ((Mixed) Integer Nonlinear Programming )

Citation: Mathematical Programming, 2018, pp. 1-39. DOI: https://doi.org/10.1007/s10107-018-1246-8

Download: [PDF]

Entry Submitted: 04/02/2017
Entry Accepted: 04/11/2017
Entry Last Modified: 07/31/2018

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society