Abstract
We introduce an alternating decomposition approach for solving global optimization problems on parallel computers. The method is based on decomposing moves in the state space into components which can be optimized concurrently. A number of features distinguish our approach from others which have been proposed in the literature. We report the results of applying the approach to energy minimization of Lennard-Jones clusters using simulated annealing. We find that the new approach is robust, has high parallel efficiency, and it can rapidly generate a good approximation to the molecular conformation.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.