Semidefinite Programming Relaxation vs Polyhedral Homotopy ...
Semidefinite Programming Relaxation vs Polyhedral Homotopy ...
Semidefinite Programming Relaxation vs Polyhedral Homotopy ...
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
Contents1. PHoMpara — Parallel implementation of the polyhedralhomotopy method ([1] Gunji-Kim-Fujisawa-Kojima ’06)2. SparsePOP — Matlab implementation of SDP relaxationfor sparse POPs ([2] Waki-Kim-Kojima-Muramatsu ’05)3. Numerical comparison between the SDP relaxation andthe polyhedral homotopy method([1]+[2]+[3] Mevissen-Kojima-Nie-Takayama)4. Concluding remarksSDP = <strong>Semidefinite</strong> Program or <strong>Programming</strong>POP = Polynomial Optimization ProblemWorkshop on Advances in Optimization, April 19-21, 2007 – p.2/24