This work benchmarks a curvature-assisted variant in which inverse-Hessian information accumulated by Broyden–Fletcher–Goldfarb–Shanno (BFGS) and limited-memory BFGS (L-BFGS) relaxation is recycled as an escape model, which requires no explicit second derivatives and no additional force evaluations before proposing low-curvature directions.
Abstract
Global structure optimization in computational chemistry is often limited not by leaving the current local minimum, which can be achieved by sufficiently large random moves, but by proposing productive moves that exploit local funnel structure without losing diversity. Minima hopping addresses this problem through short molecular-dynamics escape trajectories, local relaxation, and history-dependent feedback, but its efficiency depends strongly on the initial escape direction. We benchmark a curvature-assisted variant in which inverse-Hessian information accumulated by Broyden–Fletcher–Goldfarb–Shanno (BFGS) and limited-memory BFGS (L-BFGS) relaxation is recycled as an escape model. This requires no explicit second derivatives and no additional force evaluations before proposing low-curvature directions. Lennard–Jones (LJ) clusters with 60–74 particles provide controlled landscapes for comparing random and softened random directions, single Hessian modes, multi-mode Hessian combinations, and mixed Hessian-random directions. Dense BFGS curvature information identifies physically meaningful escape subspaces and can reduce repeated local exploration. Single deterministic modes, however, oversample local funnels, and L-BFGS curvature information is not reliable enough for direct mode selection. Combining several BFGS modes improves robustness, but softened random directions with L-BFGS remain the lowest-cost baseline. Curvature reuse is therefore most useful when it provides an inexpensive soft-mode subspace while preserving stochastic diversity, especially when conventional softening or trial-move optimization is expensive.
Reliable global optimization of atomic clusters is limited not only by the ruggedness of the potential energy surface but also by the quality of the starting population supplied to the search algorithm. We examine this issue for the Bonobo Optimizer (BO) using a workflow that combines external PyAR‐style population ini...
Bhrigu Chakraborty, A. Anoop· Journal of Computational Che...· 0 citations
Diffusion in rugged energy landscapes is central to chemical physics, with relevance to glasses, disordered solids, and biomolecular motion. Most theories assume quenched disorder, but in many condensed-phase and biological systems, local energies fluctuate because of solvent reorganization, structural relaxation, or c...
Biman Bagchi· Journal of Chemical Physics· 0 citations
Full configuration interaction (FCI) provides exact electronic structure within a given atomic basis, but its computational cost grows exponentially with the number of spin orbitals. Selected configuration interaction (SCI) methods alleviate this limitation by retaining only the most important Slater determinants. Howe...
Hayun Park, Younghun Kwon, Hunpyo Lee· 1 citation· ⚡1
Variational quantum algorithms recast state preparation as classical nonconvex optimization, but it is often unclear when multistart local search suffices and when population-based global search justifies its evaluation cost. Using a landscape-first design, controlled QAOA experiments identify two mechanisms making loc...
Oscillator Ising machines (OIMs) provide an analog dynamical approach to combinatorial optimization, but comparatively little is known about the statistical structure of the ensembles they generate. Using the Sherrington-Kirkpatrick (SK) spin-glass model, we introduce a selective oscillator scheme, OIM+, in which succe...
Directional dissipation can concentrate relaxation modes in space, but connecting this accumulation to controlled microscopic processes in correlated matter requires separating virtual charge motion from spin coherence. We study this connection in a half-filled Hubbard chain with reciprocal hopping and number-conservin...
Y.-T. Wang, X.-Z. Zhang, W.-M. Liu· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.