arXiv · cond-mat/9911142
Optimization Algorithms Based on Renormalization Group
Abstract
Global changes of states are of crucial importance in optimization algorithms. We review some heuristic algorithms in which global updates are realized by a sort of real-space renormalization group transformation. Emphasis is on the relationship between the structure of low-energy excitations and ``block-spins'' appearing in the algorithms. We also discuss the implication of existence of a finite-temperature phase transition on the computational complexity of the ground-state problem.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Naoki Kawashima. 1999-11-18. Optimization Algorithms Based on Renormalization Group. https://doi.org/10.1143/ptps.138.448
Cite the original work for its findings. Save a collection to share your selection of sources.