Using hysteresis for optimization

Physical Review Letters

Volumn 89, Issue 15, 2002, Pages 150201/1-150201/4

  Zarand G ^a,b   Pazmandi F ^b,c,e   Pal K F ^d   Zimanyi G T ^c  

^a HARVARD UNIVERSITY   (United States)

^b TU Institute of Building Constructions and Sanitary Engineering Budapest   (Hungary)

^c UNIVERSITY OF CALIFORNIA   (United States)

^d INSTITUTE OF NUCLEAR RESEARCH ATOMKI   (Hungary)

^e UNIVERSITY OF DEBRECEN   (Hungary)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DEMAGNETIZATION; GROUND STATE; MAGNETIC HYSTERESIS; OPTIMIZATION; SIMULATED ANNEALING; THERMAL NOISE; TRAVELING SALESMAN PROBLEM;

HYSTERETIC OPTIMIZATION; RANDOM EXTERNAL FIELDS;

QUANTUM THEORY;

EID: 0037037858     PISSN: 00319007     EISSN: None     Source Type: Journal    
DOI: 10.1103/PhysRevLett.89.150201     Document Type: Article

References (24)

1. S. Kirkpatrick, C. D. Gelatt, and M. P. Vecchi, Science 220, 671 (1983).
2. C.H. Papadimitriou and K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity (Prentice-Hall, Englewood Cliffs, NJ, 1982).
3. S. Gallucio, J.-P. Bouchaud, and M. Potters, Physica (Amsterdam) 259A, 449 (1998)
4. A. Gábor and I. Kondor, Physica (Amsterdam) 274A, 222 (1999).
5. G. Bertotti, Hysteresis and Magnetism (Academic Press, New York, 1998).
6. E. Della Torre, Magnetic Hysteresis (IEEE Press, Piscataway, NJ, 1999).
7. F. Preisach, Z. Phys. 94, 277 (1935).
8. We have no proof of convergence to the ground state.
9. M. Mézard, G. Parisi, and M. A. Virasoro, Spin-Glass Theory and Beyond (World Scientific, Singapore, 1987).
10. M. Palassini and A. P. Young, Phys. Rev. Lett. 85, 3017 (2000)
11. J.-F. Bouchaud (unpublished).
12. A. A. Middleton, Phys. Rev. B 63, 060202(R) (2001).
13. A. K. Hartmann, Physica (Amsterdam) 224A, 480 (1996).
14. G. Bertotti and M. Pasquale, J. Appl. Phys. 67, 5255 (1990).
15. Changing H in finite steps could produce a substantial increase in the speed of the algorithm for systems with small avalanches like the EA model.
16. We used the method of [16] to obtain the ground state for all models.
17. For a detailed algorithmic description, see G. Zarand et al., cond-mat/010359.
18. K. F. Pal, Physica (Amsterdam) 223A, 283 (1996)
19. K. F. Pal, Physica (Amsterdam) 233A, 60 (1996).
20. D.E. Goldberg, Genetic Algorithms in Search, Optimization and Machine Learning (Addison-Wesley, Reading, MA, 1989).
21. N. Kawashima and M. Suzuki, J. Phys. A 25, 1055 (1992).
22. J. Houdayer and O.C. Martin, Phys. Rev. Lett. 83, 1030 (1999), used RG combined with a genetic algorithm.
23. This cluster RG can be solved exactly for the one-diemensional EA spin glass.
24. While more complicated dynamical steps [1] can be more efficient, here we chose a less efficient dynamics which allows one to more clearly judge the performance of HO. The ground state of the TSP was found using twist dynamics [1].