potfit wiki

open source force-matching

User Tools

Site Tools

algorithms:diffevo

Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revisionPrevious revision
algorithms:diffevo [2018/01/10 18:00] – ↷ Links adapted because of a move operation danielalgorithms:diffevo [2018/01/10 18:26] (current) – ↷ Links adapted because of a move operation daniel
Line 2: Line 2:
 ====== Differential Evolution ====== ====== Differential Evolution ======
 ---- ----
-The Differential Evolution algorithm can be used instead of [[algorithms:simann]] in the optimization part of //potfit//. Enabling it with the ''evo'' compilation switch will create a binary that first uses Differential Evolution and then subsequently the [[:method_of_least_squares]] to optimize the potential.+The Differential Evolution algorithm can be used instead of [[algorithms:simann]] in the optimization part of //potfit//. Enabling it with the ''evo'' compilation switch will create a binary that first uses Differential Evolution and then subsequently the [[algorithms:lsq]] to optimize the potential.
  
 Please note that this algorithm is not tested as well as the [[algorithms:simann]] and may perform very poor with tabulated potentials. It however works well with analytic potentials because of the predefined range of the potential parameters. Please note that this algorithm is not tested as well as the [[algorithms:simann]] and may perform very poor with tabulated potentials. It however works well with analytic potentials because of the predefined range of the potential parameters.
Line 39: Line 39:
 To decide wheter or not the trial vector $\boldsymbol u_{i,G+1}$ should become a member of generation $G+1$, it is compared to the target vector $\boldsymbol x_{i,G}$. If the new vector yields a smaller target function than $\boldsymbol x_{i,G}$, then $\boldsymbol u_{i,G+1}$ replaces $\boldsymbol x_{i,G}$, otherwise $\boldsymbol x_{i,G}$ is retained. To decide wheter or not the trial vector $\boldsymbol u_{i,G+1}$ should become a member of generation $G+1$, it is compared to the target vector $\boldsymbol x_{i,G}$. If the new vector yields a smaller target function than $\boldsymbol x_{i,G}$, then $\boldsymbol u_{i,G+1}$ replaces $\boldsymbol x_{i,G}$, otherwise $\boldsymbol x_{i,G}$ is retained.
  
-For more information on DE, please take a look at the references in the DE section of [[:quotes#Differential_Evolution|Quotes]].+For more information on DE, please take a look at the references in the DE section of [[:references#Differential_Evolution|Quotes]].
  
algorithms/diffevo.1515603631.txt.gz · Last modified: 2018/01/10 18:00 by daniel