Modification of the method of sequential simplex planning and its application to the solution of optimization problems
V. S. Ovsepyan , A. S. Dertsyan
Izvestiya MGTU MAMI ›› 2013, Vol. 7 ›› Issue (1-4) : 40 -48.
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.
simplex / modification / distribution by time / optimization
| [1] |
Цирлин А.М. Вариационные методы расчета химических аппаратов.-М.: «Машиностроение», 1978 |
| [2] |
Nelder J.A, Mead R. A simplex method for function minimization. Computer J. 7:308-313, 1965 |
| [3] |
Hedar A.R, Fukushima M. Simplex coding genetic algorithm for the global optimization of nonlinear functions, Graduate School of Informatics, Kyoto University, Kyoto 6068501, Japan, 2002 |
| [4] |
Овсепян В.С., Дерцян А.С. Об одной модификации последовательного симплексного метода. Сборник трудов международной II конференции Горисского университета, Горис, 2011 |
Ovsepyan V.S., Dertsyan A.S.
/
| 〈 |
|
〉 |
PDF
