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

<table>Convergence of SDP-CUT for <svg height="10.825" id="M235" style="vertical-align:-0.11285pt" version="1.1" viewbox="0 0 39.4375 10.825" width="39.4375" xmlns="http://www.w3.org/2000/svg">
<g transform="matrix(1.25,0,0,-1.25,0,10.825)">
<g transform="translate(72,-63.34)">
<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="13.153156" y="0">=</tspan>
<tspan style="font-size: 12.50px; " x="25.193544" y="0">1</tspan>
</text>
</g>
</g>
</svg> and <svg height="11.1" id="M236" style="vertical-align:-0.17555pt" version="1.1" viewbox="0 0 39.4375 11.1" width="39.4375" xmlns="http://www.w3.org/2000/svg">
<g transform="matrix(1.25,0,0,-1.25,0,11.1)">
<g transform="translate(72,-63.12)">
<text transform="matrix(1,0,0,-1,-71.95,63.35)">
<tspan style="font-size: 12.50px; " x="0" y="0">𝑤</tspan>
<tspan style="font-size: 12.50px; " x="13.153156" y="0">=</tspan>
<tspan style="font-size: 12.50px; " x="25.193544" y="0">5</tspan>
</text>
</g>
</g>
</svg>.</table>

Journal of Applied Mathematics

fig14

Figure 14

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