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...

This paper presents a branch-and-bound algorithm for minimizing the sum of a convex function in x, a convex function in y and a bilinear term in x andy over a closed set. Such an objective function is called biconvex with biconcave functions similarly defined. The feasible region of this model permits joint constraints in x and y to be expressed. The bilinear programming problem becomes a speci...