A new accelerating method for global non-convex quadratic optimization with non-convex quadratic constraints (Q2479256): Difference between revisions

The authors investigate an extension to the algorithm proposed by \textit{S.-J. Qu, K.-C. Zhang} and \textit{Y. Ji} [Appl. Math. Comput. 186, No. 1, 763-771 (2007; Zbl 1116.65070)] to produce a novel accelerating global optimization algorithm for non-convex quadratic problems with non-convex quadratic constraints. The paper begins with a brief introduction to this problem, followed by the presentation of the new deleting technique used for eliminating a region where the global optimum solution does not exist. This technique is then incorporated in the proposed algorithm, which is presented in Section 3, and its convergence properties are studied in detail. The last section presents the results of the numerical experimentation using the proposed algorithm. The article concludes with a section containing a summary of the main contributions of this paper and a list of useful relevant references.