potfit wiki

open source force-matching

User Tools

Site Tools

algorithms:main

Differences

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

Link to this comparison view

Both sides previous revisionPrevious revision
Next revision		Previous revision
algorithms:main [2018/01/10 18:00] – danielalgorithms:main [2018/01/10 18:01] (current) – daniel
Line 101: Line 101:
 Currently there are three optimization algorithms available: Currently there are three optimization algorithms available:
   - [[algorithms:simann|Simulated Annealing]]   - [[algorithms:simann|Simulated Annealing]]
-  - [[:differential_evolution]] +  - [[algorithms:diffevo|Differential Evolution]] 
-  - [[:method_of_least_squares]] (conjugate gradients)+  - [[algorithms:lsq|Method of least squares]] (conjugate gradients)
  
 Usually two of them are run subsequently, with the choice between 1 and 2, while 3 is always run. Simulatead Annealing can be used for both tabulated and analytic potentials, Usually two of them are run subsequently, with the choice between 1 and 2, while 3 is always run. Simulatead Annealing can be used for both tabulated and analytic potentials,
 Differential Evolution may run into troubles with tabulated potentials but works fine for analytic ones.  Differential Evolution may run into troubles with tabulated potentials but works fine for analytic ones. 
algorithms/main.1515603604.txt.gz · Last modified: 2018/01/10 18:00 by daniel