Matrix Transformation Method in Quadratic Binary Optimization
The paper deals with the binary minimization of a quadratic functional. A new algorithm using matrix transformation is proposed to cope with the problem. The matrix that gave birth to the functional is replaced by a new mix-matrix. This change of the ob-jective function brings about a sharp increase in the minimization algorithm efficiency: the chances to find a global minimum grow as exp(αN) where N is the dimensionality of the problem, and the energy spectrum of minima being found shifts considerably to the deep side so that the average of the spectrum differs from the energy of the global minimum by only 4-6% (subject to the type of matrix)