Semidefinite Programming Relaxation vs Polyhedral Homotopy ...
Semidefinite Programming Relaxation vs Polyhedral Homotopy ...
Semidefinite Programming Relaxation vs Polyhedral Homotopy ...
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
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.3/24