Objective function decomposition in global optimization

Статья конференции

Khamisov O.V.

Журнал: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

11th International Conference on Learning and Intelligent Optimization, LION 2017

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol.10556 LNCS. P.338-344.

DOI: 10.1007/978-3-319-69404-7_28

ISBN: 9783319694030

2017

In this paper we consider global optimization problems in which objective functions are explicitly given and can be represented as compositions of some other functions. We discuss an approach of reducing the complexity of the objective by introducing new variables and adding new constraints. © Springer International Publishing AG 2017.

Библиографическая ссылка

Khamisov O.V. Objective function decomposition in global optimization // Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol.10556 LNCS. 2017. P.338-344. ISBN (print): 9783319694030. DOI: 10.1007/978-3-319-69404-7_28

Скопировать

d.c. function