TY - JOUR
T1 - Global optimization of a class of nonconvex quadratically constrained quadratic programming problems
AU - Xia, Yong
PY - 2011/9
Y1 - 2011/9
N2 - 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.
AB - 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.
KW - Nonconvex programming
KW - polynomial solvability
KW - quadratic assignment problem
KW - quadratically constrained quadratic programming
KW - strong duality
UR - https://www.scopus.com/pages/publications/80051862761
U2 - 10.1007/s10114-011-8351-4
DO - 10.1007/s10114-011-8351-4
M3 - 文章
AN - SCOPUS:80051862761
SN - 1439-8516
VL - 27
SP - 1803
EP - 1812
JO - Acta Mathematica Sinica, English Series
JF - Acta Mathematica Sinica, English Series
IS - 9
ER -