An Effective Global Optimization Algorithm for Quadratic Programs with Quadratic Constraints

摘要

This paper will present an effective algorithm for globally solving quadratic programs with quadratic constraints. In this algorithm, we propose a new linearization method for establishing the linear programming relaxation problem of quadratic programs with quadratic constraints. The proposed algorithm converges with the global optimal solution of the initial problem, and numerical experiments show the computational efficiency of the proposed algorithm.