ИСТИНА |
Войти в систему Регистрация |
|
ИПМех РАН |
||
The idea of the course is to introduce the theory of semidefinite programming (optimization). SDP is not only a powerful numerical approach but also a very useful analytical tool for finding approximate solutions of several NP hard problems. We consider some basic facts about semidefinite programs and some nontrivial examples of so called semidefinite relaxations of NP hard problems.