search for: spendley

...f non linear inequality constraints, the cost function, the logging system, various termination criteria, etc... - optimsimplex provides a building block for optimization algorithms based on a simplex. The optimsimplex package may be used in the following optimization methods: the simplex method of Spendley et al., the method of Nelder and Mead, Box's algorithm for constrained optimization, the multi-dimensional search by Torczon, etc... - neldermead depends on optimbase and optimsimplex and provides several direct search optimization algorithms based on the simplex method. The provided algorithms...

...f non linear inequality constraints, the cost function, the logging system, various termination criteria, etc... - optimsimplex provides a building block for optimization algorithms based on a simplex. The optimsimplex package may be used in the following optimization methods: the simplex method of Spendley et al., the method of Nelder and Mead, Box's algorithm for constrained optimization, the multi-dimensional search by Torczon, etc... - neldermead depends on optimbase and optimsimplex and provides several direct search optimization algorithms based on the simplex method. The provided algorithms...

...mization 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), the variable shape simplex method of Nelder and Mead (unconstrained optimization with a variable shape simplex made), and Box's complex method (constrained optimization with a variable shape simplex). * nga (1...