An Interior Point Method for Solving Semidefinite Programs Using Cutting Planes and Weighted Analytic Centers

<table>Feasible region of LP and the cut through the point <svg height="13.45" id="M324" style="vertical-align:-2.21957pt" version="1.1" viewbox="0 0 32.674999 13.45" width="32.674999" xmlns="http://www.w3.org/2000/svg">
<g transform="matrix(1.25,0,0,-1.25,0,13.45)">
<g transform="translate(72,-61.24)">
<text transform="matrix(1,0,0,-1,-71.95,63.5)">
<tspan style="font-size: 12.50px; " x="0" y="0">(</tspan>
<tspan style="font-size: 12.50px; " x="4.1634989" y="0">0</tspan>
<tspan style="font-size: 12.50px; " x="10.414999" y="0">,</tspan>
<tspan style="font-size: 12.50px; " x="15.616247" y="0">0</tspan>
<tspan style="font-size: 12.50px; " x="21.867746" y="0">)</tspan>
</text>
</g>
</g>
</svg>.</table>

Journal of Applied Mathematics

fig18

Figure 18

Figure 18: An Interior Point Method for Solving Semidefinite Programs Using Cutting Planes and Weighted Analytic Centers 