The global optimization method with selective averaging of the discrete decision variables
In the paper, the functional of selective averaging of discrete decision variables is proposed. The positive selectivity coefficient is entered into a positive decreasing kernel of functional and with growth of selectivity coefficient the mean gives optimum values (in a limit) of decision discrete v...
| Published in: | Вестник Томского государственного университета. Управление, вычислительная техника и информатика № 50. С. 47-55 |
|---|---|
| Main Author: | |
| Other Authors: | |
| Format: | Article |
| Language: | English |
| Subjects: | |
| Online Access: | http://vital.lib.tsu.ru/vital/access/manager/Repository/vtls:000709112 Перейти в каталог НБ ТГУ |
| LEADER | 02569nab a2200325 c 4500 | ||
|---|---|---|---|
| 001 | vtls000709112 | ||
| 003 | RU-ToGU | ||
| 005 | 20230915154515.0 | ||
| 007 | cr | | ||
| 008 | 200414|2020 ru s a eng d | ||
| 024 | 7 | |a 10.17223/19988605/50/6 |2 doi | |
| 035 | |a to000709112 | ||
| 039 | 9 | |a 202004161852 |b 100 |c 202004141310 |d VLOAD |y 202004141246 |z Александр Эльверович Гилязов | |
| 040 | |a RU-ToGU |b rus |c RU-ToGU | ||
| 100 | 1 | |a Rouban, Anatoly I. |d 1943- |9 103402 | |
| 245 | 1 | 4 | |a The global optimization method with selective averaging of the discrete decision variables |c A. I. Rouban, A. S. Mikhalev |
| 246 | 1 | 1 | |a Метод глобальной оптимизации с селективным усреднением дискретных искомых переменных |
| 504 | |a Библиогр.: 28 назв. | ||
| 520 | 3 | |a In the paper, the functional of selective averaging of discrete decision variables is proposed. The positive selectivity coefficient is entered into a positive decreasing kernel of functional and with growth of selectivity coefficient the mean gives optimum values (in a limit) of decision discrete variables in a problem of global optimization. Based on the estimate of the selective averaging functional, a basic global optimization algorithm is synthesized on a set of discrete variables with ordered possible values under inequality constraints. The basis is a computational scheme for optimizing continuous variables and its transformation for optimization with respect to discrete variables. On a test example the high convergence rate and a noise stability of base algorithm are shown. Simulations have shown that the estimate of the probability of making a true decision reaches unit. | |
| 653 | |a глобальная оптимизация | ||
| 653 | |a дискретные переменные | ||
| 653 | |a селективное усреднение | ||
| 655 | 4 | |a статьи в журналах |9 879358 | |
| 700 | 1 | |a Mikhalev, Anton Sergeevich |9 502134 | |
| 773 | 0 | |t Вестник Томского государственного университета. Управление, вычислительная техника и информатика |d 2020 |g № 50. С. 47-55 |x 1998-8605 |w 0210-40860 | |
| 852 | 4 | |a RU-ToGU | |
| 856 | 4 | |u http://vital.lib.tsu.ru/vital/access/manager/Repository/vtls:000709112 | |
| 856 | |y Перейти в каталог НБ ТГУ |u https://koha.lib.tsu.ru/cgi-bin/koha/opac-detail.pl?biblionumber=465901 | ||
| 908 | |a статья | ||
| 999 | |c 465901 |d 465901 | ||