On Minimization of a Quadratic Binary Functional

2009/07/15 by Leonid Litinskii, Leonid B. Litinskii, Litinskii, Leonid B.
Computer Science · Mathematics · Physics and Astronomy · #Disordered Systems and Neural Networks (cond-mat.dis-nn) #FOS: Physical sciences #Mathematical Dynamics and Fractals #Matrix Theory and Algorithms #Other Condensed Matter (cond-mat.other) #Theoretical and Computational Physics #cond-mat.dis-nn #cond-mat.other

paper · pdf · doi:10.48550/arxiv.0907.2551

17 pages, 16 figures

arxiv created 2009/07/15 · openalex publication_date 2009/07/15 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

The problem of minimization of a quadratic functional depending on great number of binary variables is examined. 3 variants of minimization procedure are studied with the aid of computer simulation for spin-glass matrices. It is shown that under other equal conditions evident superiority has the maximal dynamics (the greedy algorithm). The dependence of the results on a distance between start points and the ground state is investigated. It is determined that the character of distribution of local minima depends on this distance crucially.

Related

• Increasing the attraction area of the global minimum in the binary optimization problem
• Local Minima of a Quadratic Binary Functional with Quasi-Hebbian\n Connection Matrix
• Local Minima of a Quadratic Binary Functional with a Quasi-Hebbian Connection Matrix
• Minimization of Quadratic Binary Functional with Additive Connection Matrix
• Optimization Strategies in Complex Systems