paper

A method for global minimization of nonconvex quadratic functions

arXiv:2608.30611

Abstract

The problem of global minimization of nonconvex quadratic functions subject to box constraints is studied. Applying Gershgorin theorem we reduce the main matrix A to its diagonal form which is used to obtain difference of convex representation of the quadratic function. Then ε-subdifferentials of DC components are studied and used to design a method for minimizing the quadratic function globally.

11 pages

A method for global minimization of nonconvex quadratic functions · wovepaper