Modification of the method of sequential simplex planning and its application to the solution of optimization problems

V. S. Ovsepyan; A. S. Dertsyan

doi:10.17816/2074-0530-67765

Izvestiya MGTU MAMI ›› 2013, Vol. 7 ›› Issue (1-4) : 40 -48. DOI: 10.17816/2074-0530-67765

Articles

research-article

Modification of the method of sequential simplex planning and its application to the solution of optimization problems

Author information +

History +

PDF

Abstract

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.

Keywords

simplex / modification / distribution by time / optimization

Cite this article

Download citation ▾

V. S. Ovsepyan, A. S. Dertsyan. Modification of the method of sequential simplex planning and its application to the solution of optimization problems. Izvestiya MGTU MAMI, 2013, 7(1-4): 40-48 DOI:10.17816/2074-0530-67765