algorithms:simann
Differences
This shows you the differences between two versions of the page.
| Both sides previous revisionPrevious revisionNext revision | Previous revision | ||
| simulated_annealing [2013/03/05 09:19] – daniel | algorithms:simann [2018/01/10 17:59] (current) – ↷ Links adapted because of a move operation daniel | ||
|---|---|---|---|
| Line 70: | Line 70: | ||
| This will modify the basic step length by a factor between 1/3 and 3. The step scaling function is plotted in Fig. 2.6. | This will modify the basic step length by a factor between 1/3 and 3. The step scaling function is plotted in Fig. 2.6. | ||
| - | {{sa_step.png}}\\ | + | {{:sa_step.png}}\\ |
| **Figure 2.6**:The scaling factor for the basic MC step length depends on the acceptance rate. Both extremely high and extremely low rates are inefficient. From [4]. | **Figure 2.6**:The scaling factor for the basic MC step length depends on the acceptance rate. Both extremely high and extremely low rates are inefficient. From [4]. | ||
algorithms/simann.txt · Last modified: 2018/01/10 17:59 by daniel