Adaptive Search in Quasi-Monte-Carlo Optimization

1995 ◽  
Vol 64 (210) ◽  
pp. 807
Author(s):  
Christian Biester ◽  
Peter J. Grabner ◽  
Gerhard Larcher ◽  
Robert F. Tichy
1995 ◽  
Vol 64 (210) ◽  
pp. 807-807
Author(s):  
Christian Biester ◽  
Peter J. Grabner ◽  
Gerhard Larcher ◽  
Robert F. Tichy

1989 ◽  
Vol 43 (1-3) ◽  
pp. 317-328 ◽  
Author(s):  
Nitin R. Patel ◽  
Robert L. Smith ◽  
Zelda B. Zabinsky

2020 ◽  
Vol 20 (14) ◽  
pp. 1389-1402 ◽  
Author(s):  
Maja Zivkovic ◽  
Marko Zlatanovic ◽  
Nevena Zlatanovic ◽  
Mladjan Golubović ◽  
Aleksandar M. Veselinović

In recent years, one of the promising approaches in the QSAR modeling Monte Carlo optimization approach as conformation independent method, has emerged. Monte Carlo optimization has proven to be a valuable tool in chemoinformatics, and this review presents its application in drug discovery and design. In this review, the basic principles and important features of these methods are discussed as well as the advantages of conformation independent optimal descriptors developed from the molecular graph and the Simplified Molecular Input Line Entry System (SMILES) notation compared to commonly used descriptors in QSAR modeling. This review presents the summary of obtained results from Monte Carlo optimization-based QSAR modeling with the further addition of molecular docking studies applied for various pharmacologically important endpoints. SMILES notation based optimal descriptors, defined as molecular fragments, identified as main contributors to the increase/ decrease of biological activity, which are used further to design compounds with targeted activity based on computer calculation, are presented. In this mini-review, research papers in which molecular docking was applied as an additional method to design molecules to validate their activity further, are summarized. These papers present a very good correlation among results obtained from Monte Carlo optimization modeling and molecular docking studies.


Energies ◽  
2021 ◽  
Vol 14 (8) ◽  
pp. 2328
Author(s):  
Mohammed Alzubaidi ◽  
Kazi N. Hasan ◽  
Lasantha Meegahapola ◽  
Mir Toufikur Rahman

This paper presents a comparative analysis of six sampling techniques to identify an efficient and accurate sampling technique to be applied to probabilistic voltage stability assessment in large-scale power systems. In this study, six different sampling techniques are investigated and compared to each other in terms of their accuracy and efficiency, including Monte Carlo (MC), three versions of Quasi-Monte Carlo (QMC), i.e., Sobol, Halton, and Latin Hypercube, Markov Chain MC (MCMC), and importance sampling (IS) technique, to evaluate their suitability for application with probabilistic voltage stability analysis in large-scale uncertain power systems. The coefficient of determination (R2) and root mean square error (RMSE) are calculated to measure the accuracy and the efficiency of the sampling techniques compared to each other. All the six sampling techniques provide more than 99% accuracy by producing a large number of wind speed random samples (8760 samples). In terms of efficiency, on the other hand, the three versions of QMC are the most efficient sampling techniques, providing more than 96% accuracy with only a small number of generated samples (150 samples) compared to other techniques.


2020 ◽  
Vol 26 (3) ◽  
pp. 171-176
Author(s):  
Ilya M. Sobol ◽  
Boris V. Shukhman

AbstractA crude Monte Carlo (MC) method allows to calculate integrals over a d-dimensional cube. As the number N of integration nodes becomes large, the rate of probable error of the MC method decreases as {O(1/\sqrt{N})}. The use of quasi-random points instead of random points in the MC algorithm converts it to the quasi-Monte Carlo (QMC) method. The asymptotic error estimate of QMC integration of d-dimensional functions contains a multiplier {1/N}. However, the multiplier {(\ln N)^{d}} is also a part of the error estimate, which makes it virtually useless. We have proved that, in the general case, the QMC error estimate is not limited to the factor {1/N}. However, our numerical experiments show that using quasi-random points of Sobol sequences with {N=2^{m}} with natural m makes the integration error approximately proportional to {1/N}. In our numerical experiments, {d\leq 15}, and we used {N\leq 2^{40}} points generated by the SOBOLSEQ16384 code published in 2011. In this code, {d\leq 2^{14}} and {N\leq 2^{63}}.


2019 ◽  
Vol 133 ◽  
pp. S480-S481
Author(s):  
S. Trivellato ◽  
E. Rondi ◽  
S. Vigorito ◽  
E. Miglietta ◽  
F. Castellini ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document