neldermead

Provides several direct search optimization algorithms based on the simplex method. The provided algorithms are direct search algorithms, i.e. algorithms which do not use the derivative of the cost function. They are based on the update of a simplex. The following algorithms are available: the fixed shape simplex method of Spendley, Hext and Himsworth (unconstrained optimization with a fixed shape simplex, 1962) doi:10.1080/00401706.1962.10490033, the variable shape simplex method of Nelder and Mead (unconstrained optimization with a variable shape simplex made, 1965) doi:10.1093/comjnl/7.4.308, and Box's complex method (constrained optimization with a variable shape simplex, 1965) doi:10.1093/comjnl/8.1.42.

Last 30 days

This package has been downloaded 370 times in the last 30 days. More than a random curiosity, but not quite a blockbuster. Still, it's gaining traction! The following heatmap shows the distribution of downloads per day. Yesterday, it was downloaded 9 times.

The following line graph shows the downloads per day. You can hover over the graph to see the exact number of downloads per day.

Last 365 days

This package has been downloaded 5,764 times in the last 365 days. That's a lot of interest! Someone might even write a blog post about it. The day with the most downloads was Jul 21, 2024 with 134 downloads.

The following line graph shows the downloads per day. You can hover over the graph to see the exact number of downloads per day.