Top > Seminars & Events > Seminars > Computation on non-strict feasible semidefinite...


Computation on non-strict feasible semidefinite program

Hold Date
2017-10-03 12:00〜2017-10-03 13:00
Lecture Room S W1-C-504, West Zone 1, Ito campus, Kyushu University
Object person
Hayato WAKI (Institute of Mathematics for Industry, Kyushu University)

Semidefinite program (SDP) is the convex minimization on matrix variables. Some efficient algorithms to solve SDPs, e.g., the ellipsoid method and interior-point method are proposed, and applications of combinatorial optimization, polynomial optimization, control and statistics etc are well-known. The strict feasibility of SDP guarantees the celebrated strong duality theorem on SDP and the convergence of algorithms to solve SDP. However non-strictly feasible SDPs often appear in these applications, and the numerical behavior of algorithms for SDPs are numerically unstable. We talk about computational aspects on such SDPs. In particular, we show that in some of the applications, the non-strict feasibility comes from an intrinsic nature of the applications.