This shows you the differences between two versions of the page.
Both sides previous revision Previous revision Next revision | Previous revision Next revision Both sides next revision | ||
derivative_free_optimization [2012/05/24 09:53] prokop |
derivative_free_optimization [2012/05/24 09:53] prokop |
||
---|---|---|---|
Line 2: | Line 2: | ||
====== Derivative Free Optimization ====== | ====== Derivative Free Optimization ====== | ||
- | http://en.wikipedia.org/wiki/Pattern_search_(optimization) | + | -http://en.wikipedia.org/wiki/Pattern_search_(optimization) |
- | http://en.wikipedia.org/wiki/Random_search | + | -http://en.wikipedia.org/wiki/Random_search |
- | http://en.wikipedia.org/wiki/Nelder%E2%80%93Mead_method (Ameba) | + | -http://en.wikipedia.org/wiki/Nelder%E2%80%93Mead_method (Ameba) |
Pattern search je relativne rychly protoze sampluje pouze vyznacne smery. Minimalne sampluje 1 smer, maximalne 2N. Pamatuje si predchozi smer takze se pohybuje effektivne. | Pattern search je relativne rychly protoze sampluje pouze vyznacne smery. Minimalne sampluje 1 smer, maximalne 2N. Pamatuje si predchozi smer takze se pohybuje effektivne. |