Abstract In this paper, we study some bounds for nonconvex quadratically constrained quadratic programs (QCQPs). We propose two types of QCQPs, and cubic bounds. use affine functions as Lagrange multipliers demonstrate that most semidefinite relaxations can be obtained the dual a bound. addition, by changing ground set. For bounds, in addition to employ functions. provide comparison between pro...

1. I N T R O D U C T I O N Global optimization of constrained quadratic problems has been the subject of active research during the last two decades. Quadratic programming is a very old and important problem of optimization. It has numerous applications in many diverse fields of science and technology and plays a key role in many nonlinear programming methods. Nonconvex quadratic programming re...