Abstract: Under the basic frame of evolution computations (EA) and the kernel idea of Nelder-Mead simplex method, a novel evolution algorithm (EA), namely the two dimensions simplex EA (2D-simplexEA), ...

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 ...