期刊
OPTIMIZATION METHODS & SOFTWARE
卷 24, 期 4-5, 页码 485-504出版社
TAYLOR & FRANCIS LTD
DOI: 10.1080/10556780902883184
关键词
nonconvex quadratic programming; polyhedral relaxation; convex envelope; cutting plane; global optimization
This article addresses the generation of strong polyhedral relaxations for nonconvex, quadratically constrained quadratic programs (QCQPs). Using the convex envelope of multilinear functions as our starting point, we develop a polyhedral relaxation for QCQP, along with a cutting plane algorithm for its implementation. Our relaxations are multiterm, i.e. they are derived from the convex envelope of the sum of multiple bilinear terms of quadratic constraints, thereby providing tighter bounds than the standard termwise relaxation of the bilinear functions. Computational results demonstrate the usefulness of the proposed cutting planes.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据