Modification of the method of sequential simplex planning and its application to the solution of optimization problems
A modification of the algorithm Nealder-Mida is proposed when the point, which determines the direction of reflection the “worst” node, is chosen based on the values of minimazed functions in the rest of the vertices of a simplex. There was investigated the efficiency of the proposed modifications on the test functions.