Global Optimization Studies on the 1-D Phase Problem

Int. J. Of General Systems 25 (1):47-59 (1996)
  Copy   BIBTEX

Abstract

The Genetic Algorithm (GA) and Simulated Annealing (SA), two techniques for global optimization, were applied to a reduced (simplified) form of the phase problem (RPP) in computational crystallography. Results were compared with those of "enhanced pair flipping" (EPF), a more elaborate problem-specific algorithm incorporating local and global searches. Not surprisingly, EPF did better than the GA or SA approaches, but the existence of GA and SA techniques more advanced than those used in this study suggest that these techniques still hold promise for phase problem applications. The RPP is, furthermore, an excellent test problem for such global optimization methods

Links

PhilArchive

External links

  • This entry has no external links. Add one.
Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Analytics

Added to PP
2013-08-17

Downloads
196 (#104,856)

6 months
56 (#86,202)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Martin Zwick
Portland State University

Citations of this work

The Mermin Fixed Point.Veit Elser - 2003 - Foundations of Physics 33 (11):1691-1698.

Add more citations

References found in this work

No references found.

Add more references