Semidefinite Programming
Presenter
August 3, 2016
Keywords:
- conic optimization, cone of positive semidefinite matrices, SDP models, conic duality, self-concordant barrier, central path following algorithm
MSC:
- 47L07
Abstract
In this talk we will introduce conic optimization models, in particular second-order cone programming (SOCP) and semidefinite programming (SDP). We will discuss various applications of these new optimization models. Conic duality theory will be introduced as well. Finally we will introduce the so-called central path following method for solving semidefinite programming.