(Sun, 04/05/2020 - 21:14 | 2 comments)
Please implement the Nelder-Mead Simplex Direct Search Method in Foldit
|Opened on:||Sunday, April 5, 2020 - 21:14|
|Last modified:||Monday, April 6, 2020 - 01:50|
Would someone please implement in Foldit, as either a LUA Recipe or a built-in LUA command, an optimization algorithm like the Nelder-Mead Simplex Direct Search Method (implemented in Matlab as the fminsearch command and in "Numerical Recipes in C" as the amoeba recipe)? fminsearch can find the minimum of a function f of multiple variables even when the derivatives of f with respect to these variables are unknown. While fminsearch is not guaranteed to give the global minimum of f, I have seen fminsearch give good solutions when optimizing up to about 20 variables. For more information, please see: https://www.mathworks.com/help/matlab/ref/fminsearch.html https://www.mathworks.com/help/matlab/math/optimizing-nonlinear-functions.html#bsgpq6p-11 https://www.grad.hr/nastava/gs/prg/NumericalRecipesinC.pdf sections 10.0 & 10.4. The pdf above is "Numerical Recipes in C: The Art of Scientific Computing" Second Edition by William H Press, Saul A Teukolsky, William T Vetterling, and Brian P Flannery, Cambridge University Press, ISBN=0-521-43108-5. It seems to be the 1992 version but reprinted with corrections in 2002. Sections 10.0 & 10.4 are pp.394-397 & 408-412 in the text but pp.418-421 & 432-436 in the pdf.