Branch-delete-bound algorithm for globally solving quadratically constrained quadratic programs

This paper presents a branch-delete-bound algorithm for effectively solving the global minimum of quadratically constrained quadratic programs problem, which may be nonconvex. By utilizing the characteristics of quadratic function, we construct a new linearizing method, so that the quadratically constrained quadratic programs problem can be converted into a linear relaxed programs problem. Moreover, the established linear relaxed programs problem is embedded within a branch-and-bound framework without introducing any new variables and constrained functions, which can be easily solved by any effective linear programs algorithms. By subsequently solving a series of linear relaxed programs problems, the proposed algorithm can converge the global minimum of the initial quadratically constrained quadratic programs problem. Compared with the known methods, numerical results demonstrate that the proposed method has higher computational efficiency