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

Author's Profile

Martin Zwick
Portland State University

Analytics

Added to PP
2013-08-17

Downloads
194 (#72,787)

6 months
55 (#79,574)

Historical graph of downloads since first upload
This graph includes both downloads from PhilArchive and clicks on external links on PhilPapers.
How can I increase my downloads?