Location of Repository

Comparison of convex relaxations of quadrilinear terms

By Sonia Cafieri, Jon Lee and Leo Liberti

Abstract

In this paper we compare four different ways to compute a convex linear relaxation of a quadrilinear monomial on a box, analyzing their relative tightness. We computationally compare the quality of the relaxations, and we provide a general theorem on pairwise-comparison of relaxation strength, which applies to some of our pairs of relaxations for quadrilinear monomials. Our results can be used to configure a spatial Branch-and-Bound global optimization algorithm. We apply our results to the Molecular Distance Geometry Problem, demonstrating the usefulness of the present study. quadrilinear; convex relaxation; reformulation; global optimization, spatial Branch

Year: 2010
OAI identifier: oai:CiteSeerX.psu:10.1.1.161.3186
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.lix.polytechnique.f... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.