Related Experiment Video
Updated: Jun 4, 2026

Detection of Architectural Distortion in Prior Mammograms via Analysis of Oriented Patterns
Published on: August 30, 2013
Efficient moves for global geometry optimization methods and their application to binary systems
Michael Sicher1, Stephan Mohr, Stefan Goedecker
1Department of Physics, Universität Basel, Klingelbergstr. 82, 4056 Basel, Switzerland. michael.sicher@stud.unibas.ch
Abstract:
We show that molecular dynamics based moves in the minima hopping method are more efficient than saddle point crossing moves. For binary systems we incorporate identity exchange moves in a way that allows one to avoid the generation of high energy configurations. Using this modified minima hopping method, we re-examine the binary Lennard-Jones benchmark system with up to 100 atoms and we find a large number of new putative global minima.
Related Concept Videos
Optimization Problems
Gaussian Elimination: Problem Solving
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...
Methods of Medium Optimization
Woodward–Hoffmann Selection Rules and Microscopic Reversibility
Statically Indeterminate Problem Solving