ALGORITHMS OF COORDINATES AVERAGING METHOD FOR SEARCHING OF THE PRINCIPAL MINIMUM OF MULTIEXTREME FUNCTIONS


Cite item

Full Text

Abstract

Tn the article we propose algorithms for search of the set quantity of the principal minimum of multiextremal functions of continuous variables. The basis of the algorithms is sequential search of global extremum based on coordinates averaging method, with subsequent isolation of the found subdomains with the help of additional inequalities constraints. On numerical examples we demonstrate the overall effectiveness of the algorithms.

References

  1. Рубан А. И. Метод непараметрической поисковой оптимизации // Изв. вузов. Физика. 1995. Т. 38, № 9. С. 65-73.
  2. Рубан А. И. Глобальная оптимизация методом усреднения координат : монография. Красноярск : ИПЦ КГТУ, 2004.
  3. Кузнецов А. В., Рубан А. И. Поиск главных минимумов многоэкстремальных функций при активном учете ограничений неравенств // Техника и технологии : журн. СФУ. 2010. Т. 3, № 3. С. 335-346.

Supplementary files

Supplementary Files
Action
1. JATS XML

Copyright (c) 2010 Kuznetsov A.V., Ruban A.I., Kuznetsov A.V., Rouban A.I.

Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 International License.

This website uses cookies

You consent to our cookies if you continue to use our website.

About Cookies