Abstract: In this work, we extend the simplex algorithm of linear programming for finding a local minimum of a concave quadratic function subject to box constraints. In order to test the performance ...

Abstract: The Nelder-Mead simplex method is a well-known algorithm enabling the minimization of functions that are not available in closed-form and that need not be differentiable or convex.