Minimizing a Function using Simulated Annealing 2
- Mark as New
- Bookmark
- Subscribe
- Mute
- Subscribe to RSS Feed
- Permalink
- Notify Moderator
Minimizing a Function using Simulated Annealing 2
The video shows a simulated annealing algorithm finding the global minimum of a function with many local minima. It takes less than a tenth of a second to do this. Due to the limitation of 999 frames in a Mathcad animation the video only shows about the last third of the minimization (the first two thirds are of course a lot more random, and the candidate solutions are at higher points on the surface). Ten iterations are shown in each frame
See here for the worksheet: Minimizing a Function using Simulated Annealing
and here for another video: Video Link : 6848
- Chapters
- descriptions off, selected
- captions settings, opens captions settings dialog
- captions off, selected
This is a modal window.
Beginning of dialog window. Escape will cancel and close the window.
End of dialog window.
This is a modal window. This modal can be closed by pressing the Escape key or activating the close button.
- Labels:
-
Other
- Mark as New
- Bookmark
- Subscribe
- Mute
- Subscribe to RSS Feed
- Permalink
- Notify Moderator
>Due to the limitation of 999 frames in a Mathcad animation
You can try to have frames from -999 to 999
- Mark as New
- Bookmark
- Subscribe
- Mute
- Subscribe to RSS Feed
- Permalink
- Notify Moderator
See please Optimization with Genetic algorithm
I have plans (with Vladimir Sabanin and his student) to put here more animations with genetic and others algorithm.
- Mark as New
- Bookmark
- Subscribe
- Mute
- Subscribe to RSS Feed
- Permalink
- Notify Moderator
You can try to have frames from -999 to 999
Good suggestion, but it doesn't work. FRAME does not like negative numbers
