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

<table>SDP-CUT iterations against the number of constraints <svg height="9.875" id="M192" style="vertical-align:-2.29482pt" version="1.1" viewbox="0 0 7.9124999 9.875" width="7.9124999" xmlns="http://www.w3.org/2000/svg">
<g transform="matrix(1.25,0,0,-1.25,0,9.875)">
<g transform="translate(72,-64.1)">
<text transform="matrix(1,0,0,-1,-71.95,66.44)">
<tspan style="font-size: 12.50px; " x="0" y="0">𝑞</tspan>
</text>
</g>
</g>
</svg>.</table>

Journal of Applied Mathematics

fig6

Figure 6

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