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

<table>The first cutting constraint and an initial point <svg height="16.950001" id="M74" style="vertical-align:-4.35121pt" version="1.1" viewbox="0 0 15.0625 16.950001" width="15.0625" xmlns="http://www.w3.org/2000/svg">
<g transform="matrix(1.25,0,0,-1.25,0,16.95)">
<g transform="translate(72,-58.44)">
<text transform="matrix(1,0,0,-1,-71.95,62.83)">
<tspan style="font-size: 12.50px; " x="0" y="0">𝑥</tspan>
</text>
<text transform="matrix(1,0,0,-1,-65.07,67.83)">
<tspan style="font-size: 8.75px; " x="0" y="0">∗</tspan>
<tspan style="font-size: 8.75px; " x="0" y="9.2200003">0</tspan>
</text>
</g>
</g>
</svg>.</table>

Journal of Applied Mathematics

fig2

Figure 2

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