Community Tip - Your Friends List is a way to easily have access to the community members that you interact with the most! X

Translate the entire conversation x

Minimizing a Function using Simulated Annealing 2

RichardJ
19-Tanzanite

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

 

ddb035f9e1bdb_Simulated_Annealing_2.mp4
Video Player is loading.
Current Time 0:00
Duration 0:00
Loaded: 0%
Stream Type LIVE
Remaining Time 0:00
 
1x
    • Chapters
    • descriptions off, selected
    • captions off, selected
      (view in My Videos)

      3 REPLIES 3

      >Due to the limitation of 999 frames in a Mathcad animation

      You can try to have frames from -999 to 999

      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. 

      RichardJ
      19-Tanzanite
      (To:RichardJ)

      You can try to have frames from -999 to 999

      Good suggestion, but it doesn't work. FRAME does not like negative numbers

      Announcements

      Top Tags