In this paper, we propose a second-order corrector interior-point algorithm for semidefinite programming (SDP). This algorithm is based on the wide neighborhood. The complexity bound is $${O(\sqrt{n}L)}$$ for the Nesterov-Todd direction, which coincides with the best known complexity results for...

In this paper, we propose a second-order corrector interior-point algorithm for semidefinite programming (SDP). This algorithm is based on the wide neighborhood. The complexity bound is <InlineEquation ID="IEq1"> <EquationSource Format="TEX">$${O(\sqrt{n}L)}$$</EquationSource> </InlineEquation> for the Nesterov-Todd direction, which coincides with the best known complexity results...</equationsource></inlineequation>

In this paper, we have presented the second level nesting of Bonney's disposition model (Bonney, 1998) and examined the implications of higher level nesting of the disposition model in relation to the dimension of the parameter space. We have also compared the performance of the disposition...