Minima Hopping Method (MHM)

Updated 31 January 2026

Minima Hopping Method (MHM) is a global optimization algorithm that integrates MD-based escapes and adaptive feedback to efficiently locate low-energy configurations in atomistic systems.
It employs short molecular dynamics trajectories aligned with soft modes to overcome energy barriers and rapidly relax structures to their nearest minima.
MHM is applied to crystal structure prediction, reaction pathway mapping, and interface analysis, with modern extensions using high-throughput and machine learning techniques.

The Minima Hopping Method (MHM) is a global optimization algorithm for efficient exploration and identification of low-energy structures on high-dimensional potential-energy surfaces (PES), primarily in atomistic and condensed-matter systems. MHM circumvents the trapping and inefficiency endemic to conventional random search or genetic algorithms by combining physically motivated molecular dynamics (MD) escape trajectories, biasing towards low-barrier transitions, local geometry relaxations, and adaptive feedback loops. Designed for both periodic (crystal) and aperiodic (cluster, interface) environments, MHM has become a foundational approach for crystal structure prediction, reaction path mapping, and interface structure discovery, with extensions to large-scale, high-throughput, and machine-learning-accelerated calculations (Chou et al., 24 Jan 2026, Amsler et al., 2010, Schaefer et al., 2014, Krummenacher et al., 2023, Amsler et al., 2019).

1. Theoretical Foundation

The central objective in atomistic structure prediction is the location of the global or key low-lying minima on a PES, $E(\{r_i\})$ , or on the configurational enthalpy surface $H(\mathbf{R}) = E(\mathbf{R}) + P V(\mathbf{R})$ under external pressure (Flores-Livas et al., 2015, Amsler et al., 2010). For $N$ atoms, the dimensionality (usually $3N$ or $3N+9$ in periodic cells with variable shape) renders exhaustive enumeration prohibitive. MHM approaches this global optimization task with two fundamental physical insights:

MD-based barrier crossing: Short microcanonical or thermostatted MD trajectories ("escapes") allow the system to transition out of the current local minimum's catchment basin, crossing energy barriers otherwise insurmountable in static relaxations.
Soft-mode alignment and Bell–Evans–Polanyi principle: Initial escape directions are preferentially aligned with soft (low-curvature) modes, increasing the likelihood that the system will cross low-energy barriers into deeper, yet-unexplored funnels rather than executing random walks (Amsler et al., 2010, Schaefer et al., 2014).

This framework allows MHM to efficiently discover not only ground-state structures but also metastable configurations and complex transition paths.

2. Algorithmic Workflow and Feedback Mechanisms

The MHM operates as an iterative loop, combining MD escapes, local minimizations, and energetic acceptance criteria, governed by adaptive feedback on the key parameters. A representative pseudocode is as follows (Chou et al., 24 Jan 2026, Schaefer et al., 2014, Flores-Livas et al., 2015):

initialize current minimum
set kinetic energy or temperature (E_kin or T)
for hop in 1 .. Nmax:
    # 1. MD escape step
    assign velocities (bias to soft modes); run short MD; obtain escape configuration
    # 2. Local relaxation
    relax configuration to nearest local minimum
    # 3. Acceptance and adaptive control
    if new minimum:
        reduce T or E_kin (exploit new funnel)
    else:
        increase T or E_kin (escape deeper/faster)
    # 4. Optional: Metropolis or threshold acceptance criteria
    pass
end

Core features across implementations include:

Local relaxation convergence: Forces are minimized to system-dependent thresholds (e.g., $|F| < 0.005$ eV/Å for MLIP-driven runs; $<2$ meV/Å in high-pressure DFT (Chou et al., 24 Jan 2026, Flores-Livas et al., 2015)).
Acceptance probability: Deterministic (accept all new minima), energetic threshold ( $\Delta E < E_{\rm diff}$ ), or Metropolis-like acceptance,

$P_{\rm accept} = \begin{cases} 1, & \Delta E \le 0 \ \exp(-\Delta E / k_B T), & \Delta E > 0 \end{cases}$

Adaptive feedback: Upon unsuccessful escape (relaxation returns to known minimum), increase $T$ or $E_{\rm kin}$ (e.g., $T \to T \times \alpha_{\rm inc}$ , $\alpha_{\rm inc} \approx 1.1-1.2$ ); upon successful new minimum, reduce ( $T \to T / \alpha_{\rm dec}$ , $\alpha_{\rm dec} \approx 1.1-1.2$ ) (Chou et al., 24 Jan 2026, Sicher et al., 2010).
History handling: Visited minima tracked (hashes, fingerprints); optional bias potentials or database-shared temperature feedback discourage redundant revisiting (Krummenacher et al., 2023, Chou et al., 24 Jan 2026).
MD move generation: Velocities sampled from Maxwell–Boltzmann at $T$ , then "softened" into leading Hessian eigenmodes (Amsler et al., 2010, Flores-Livas et al., 2015, Amsler et al., 2019).

This feedback-driven loop guarantees "explosion condition"—repeated fails cause $E_{\rm kin}$ to exceed any finite local barrier, ensuring eventual escape from deep basins (Schaefer et al., 2014).

3. Variable-Cell and Structural Extensions

To address periodic materials and bulk crystals, MHM can be generalized to include cell-shape degrees of freedom and external pressure (Amsler et al., 2010, Flores-Livas et al., 2015):

Enthalpy-based search: Optimization target is $H_c(\{s_i\}, h) = E(\{s_i\}, h) + P \Omega(h)$ , with volume $\Omega(h)=\det(h)$ , where $h$ is the 3x3 lattice matrix.
Parrinello–Rahman MD: Escape moves propagate both atomic and cell velocities per extended-Lagrangian equations, so the accessible landscape encompasses polymorphic transitions and pressure-induced phase changes.
Cell reduction heuristics: To prevent cell distortion or volume drift, lattice-vector reduction and volume constraints can be applied (Amsler et al., 2010).
Extension to clusters, surfaces, and interfaces: By modifying which cell vectors relax (e.g., fixing in-plane for interfaces (Chou et al., 24 Jan 2026)), MHM can target specific boundary, defect, or nanoarchitecture structure searches.

Additional move types can be incorporated for chemical complexity (e.g., identity exchange moves for binary systems, effective for $\sigma_{\mathrm{size}} \lesssim 1.2$ (Sicher et al., 2010)).

4. Integration with Machine Learning and High Throughput

Recent developments have coupled MHM with high-fidelity, machine learning interatomic potentials (MLIPs), enabling rapid, near-ab initio quality exploration for large or chemically complex systems (Chou et al., 24 Jan 2026, Amsler et al., 2019, Krummenacher et al., 2023):

MLIP coupling: The MHM invokes a fast MLIP (e.g., Allegro, CENT) for energy/force evaluations during both escape MD and relaxations, gaining 3–5 orders-of-magnitude speedup relative to DFT-based MHM searches (Chou et al., 24 Jan 2026, Amsler et al., 2019).
Training sets: Defect- and interface-extrapolative MLIPs can be trained from randomly sampled, defect-free configurations plus enrichment via short MD and direct sampling (e.g., DIRECT) to generate data sets without explicit defects (Chou et al., 24 Jan 2026).
Workflow: After generating a wide pool of candidate low-energy minima (often $10^4$ – $10^5$ structures), only a small subset of lowest-energy candidates require post hoc DFT ranking for final selection.
Multilevel parallelization: Modern implementations (e.g., with ASE) employ MPI-based parallelism across multiple walkers with database sharing and coordinated adaptive temperature feedback, further increasing throughput and minimizing redundant searches (Krummenacher et al., 2023).

These strategies enable practical global structure discovery on system sizes and chemistries previously unattainable by direct DFT search.

5. Performance Benchmarks and Applications

MHM has demonstrated leading performance across diverse systems:

System/Task	Approach	Typical Cost and Output	Reference
SrTiO₃ grain boundaries	MHM–Allegro MLIP	$\sim 10^4$ MLIP calls; $\sim 10^2$ – $10^3\times$ speedup over DFT-MHM; lowest-energy GBs for all stoichiometries	(Chou et al., 24 Jan 2026)
PH $_n$ (high-pressure)	MHM–DFT	Global minimum found for each $n$ and $P$ ; formation enthalpies 30–200 meV/atom	(Flores-Livas et al., 2015)
CH $_3$ NH $_3$ PbI $_3$	MHM–force field + DFT	$10^5$ minima sampled (96 atoms); 1000 $\times$ faster than DFT-MHM; new predicted phases	(Flores-Livas et al., 2018)
Si 64-atom supercell	Periodic-cell MHM (EDIP)	45%–80% success after $10^4$ minima (vs. $10^6$ for fixed-cell); robust to pressure, defects	(Amsler et al., 2010)
Binary Lennard-Jones	MHM +/– exchanges	$2$– $3\times$ faster with exchanges ( $\sigma\lesssim 1.2$ ); $17$ new global minima found	(Sicher et al., 2010)

MHM is routinely used for bulk phase, interface/grain boundary, nano-cluster, and surface structure prediction, as well as to enumerate basins for reaction pathway mapping (MHGPS) (Schaefer et al., 2014).

6. Implementation Considerations and Parameter Selection

Best practices for MHM setup include (Chou et al., 24 Jan 2026, Amsler et al., 2010, Flores-Livas et al., 2015, Krummenacher et al., 2023, Amsler et al., 2019):

MD escape parameters: Length 50–200 steps (1 fs per step for atomic, shorter for harder DOFs); energy (or temperature) initialized to the order of expected barrier heights.
Velocity initialization: Align toward lowest-curvature Hessian eigenvectors; include randomization for ergodicity.
Adaptive feedback tuning: Acceptance thresholds and kinetic energy update factors ( $\alpha_{\rm inc}$ , $\alpha_{\rm dec}$ , $\beta$ , etc.) are iteratively adjusted to maintain an acceptance ratio $\sim 50\%$ and efficient funnel exploration.
History/fingerprint pruning: Structures are classified new if their representations (e.g., fingerprint vectors, energies) differ by more than a user-tunable threshold.
Parallelization: Employ multiple independent or database-sharing processes for enhanced sampling and reduced computational wall time.

When incorporated with MLIPs, model selection and dataset diversity (composition/volume, off-equilibrium sampling, rejection of unphysical structures) are essential for robust extrapolative accuracy (Chou et al., 24 Jan 2026).

7. Limitations, Extensions, and Outlook

Key limitations of MHM are associated with potential quality (inaccuracies in force fields or MLIPs can bias searches), computational scaling for very large systems at high ab initio accuracy, and challenges in sampling extremely rare-event regions (ultra-high barriers) (Flores-Livas et al., 2015, Amsler et al., 2010). Current and prospective extensions include:

Explicit long-range interactions: Incorporating electrostatics (e.g., Ewald summation or charge-equilibration within MLIPs) for oxides and polar systems (Chou et al., 24 Jan 2026).
Complex move sets: Identity-exchange and fragmentation-fixing moves for clusters, and compositional mutation steps for alloys (Sicher et al., 2010, Krummenacher et al., 2023).
Reaction pathway search: MHM sequences can be paired with double-ended transition-state searches (e.g., Bar-Saddle or NEB) to map complex chemical reaction networks (MHGPS) (Schaefer et al., 2014).
Biasing and history potentials: Metadynamics-like order-parameter biases can further discourage revisiting identical basins and accelerate search (Chou et al., 24 Jan 2026).
Hybrid workflows: Combining fast, exhaustive minima generation on cheap potentials with post hoc DFT validation for scalable, high-fidelity structure prediction (Flores-Livas et al., 2018).

In summary, the Minima Hopping Method, by integrating MD-based escapes, adaptive feedback, configurable acceptance controls, and flexible energy/force backends, constitutes a robust, nearly parameter-free, and extensible platform for global structure optimization and exploration in computational materials science (Chou et al., 24 Jan 2026, Flores-Livas et al., 2015, Amsler et al., 2010, Schaefer et al., 2014, Krummenacher et al., 2023, Amsler et al., 2019).