Global optimization of a class of nonconvex quadratically constrained quadratic programming problems

被引：0
|
作者：
Yong Xia
机构：
[1] Beihang University,LMIB of the Ministry of Education; School of Mathematics and Systems Science
来源：
Acta Mathematica Sinica, English Series | 2011年 / 27卷
关键词：
Nonconvex programming; quadratically constrained quadratic programming; quadratic assignment problem; polynomial solvability; strong duality; 49N15; 90C20; 90C27;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
In this paper we study a class of nonconvex quadratically constrained quadratic programming problems generalized from relaxations of quadratic assignment problems. We show that each problem is polynomially solved. Strong duality holds if a redundant constraint is introduced. As an application, a new lower bound is proposed for the quadratic assignment problem.
引用
收藏
页码：1803 / 1812
页数：9
相关论文
共 50 条
12345