Страница публикации

On Solving Optimization Problems with Hidden Nonconvex Structures

Авторы: Strekalovsky A.S.

Журнал: Optimization in Science and Engineering

Том:

Номер:

Год: 2014

Отчётный год: 2014

Издательство:

Местоположение издательства:

URL:

Проекты:

DOI: 10.1007/978-1-4939-0808-0_23

Аннотация: Here we consider three very popular optimization problems: the linear complementarity problem, the search for Nash equilibria in a bimatrix game, and the quadratic-linear bilevel programming problem. It can be shown that each of the problem possesses a hidden nonconvexity and, as a consequence, a rather large number of local solutions which are different from global ones from the viewpoint of the goal function. In order to attack these problems the principal points of Global Search theory are presented and discussed. Furthermore, the main stages of Local and Global Search Methods are precised for each problem. Finally, we present the new results of computational solution separately for every problem considered. © Springer Science+Business Media New York 2014. All rights are reserved.

Индексируется WOS: Нет

Индексируется Scopus: Нет

Индексируется УБС: Нет

Индексируется РИНЦ: Да

Индексируется ВАК: Нет

Индексируется CORE: Нет

Публикация в печати: 0