five

Optimization of Transferable Site–Site Potentials Using a Combination of Stochastic and Gradient Search Algorithms

收藏
NIAID Data Ecosystem2026-03-07 收录
下载链接:
https://figshare.com/articles/dataset/Optimization_of_Transferable_Site_Site_Potentials_Using_a_Combination_of_Stochastic_and_Gradient_Search_Algorithms/2526622
下载链接
链接失效反馈
官方服务:
资源简介:
Discontinuous molecular dynamics (DMD) simulation and thermodynamic perturbation theory (TPT) have been used to study thermodynamic properties for organic compounds. The aim is to infer transferable intermolecular potential models based on correlating the vapor pressure and liquid density. The combination of DMD/TPT generates a straightforward global optimization problem for the attractive potential, instead of facing an iterative optimization–simulation type problem. This global optimization problem is then formulated as a black-box optimization problem and solved using a combination of random recursive search (RRS) and Levenberg–Marquardt (LM) optimization. RRS is suitable for black-box optimization problems since its algorithm is robust to the effect of random noises in the objective function and is advantageous in optimizing the objective function with negligible parameters. LM is efficient local to an optimum with a smooth response surface. The local response surface is shown to be smooth but very flat along valleys with a high degree of coupling between the potential parameters. The algorithm is demonstrated with discretized versions of the Lennard-Jones (LJ) potential and a linear step potential using a database of 231 hydrocarbons, alcohols, aldehydes, amines, amides, esters, ethers, ketones, phenols, sulfides, and thiols. A correspondence is established between the discretized LJ potential and the TraPPE model, demonstrating the manner of improving density estimates and a way of expediting improvement of continuous transferable potentials.
创建时间:
2012-05-02
5,000+
优质数据集
54 个
任务类型
进入经典数据集
二维码
社区交流群

面向社区/商业的数据集话题

二维码
科研交流群

面向高校/科研机构的开源数据集话题

数据驱动未来

携手共赢发展

商业合作