File:MCS algorithm.gif

Summary

Description
English: Minimization of the two-dimensional Rosenbrock function via MCS (the global minimum is located at (1,1)). The optimization process can be characterized by three stages: 1. Identify a potential box for splitting (magenta) 2. Extract the optimal splitting direction and splitting values (green) 3. If the box is considered to be a good candidate then split it into subboxes with sizes dictated by the value of the objective function at the spitting values. Note that at least one of the splitting values (yellow) always concides with a known sample hence the value of the objective function is already known there.
Date
Source Own work
Author Najko32

Licensing

I, the copyright holder of this work, hereby publish it under the following license:
w:en:Creative Commons
attribution share alike
This file is licensed under the Creative Commons Attribution-Share Alike 4.0 International license.
You are free:
  • to share – to copy, distribute and transmit the work
  • to remix – to adapt the work
Under the following conditions:
  • attribution – You must give appropriate credit, provide a link to the license, and indicate if changes were made. You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
  • share alike – If you remix, transform, or build upon the material, you must distribute your contributions under the same or compatible license as the original.
Category:CC-BY-SA-4.0#MCS%20algorithm.gif
Category:Self-published work Category:Animated GIF files Category:Animated GIF files between 50 MP and 100 MP Category:Optimization algorithms and methods
Category:Animated GIF files Category:Animated GIF files between 50 MP and 100 MP Category:CC-BY-SA-4.0 Category:Optimization algorithms and methods Category:Self-published work