A New Primal-Dual Interior-Point Method for Semidefinite Optimization Based on a New Wide Neighborhood with Infinity-Norm

In this paper, we present a new primal-dual interior-point algorithm based on a new large neighbourhood N∞(τ ,β) for semidefinite optimization. This large neighbourhood is based on the infinity norm. It is larger than the N(τ ,β) large neighborhood of the central path, which is popular wide neighborhood. We demonstraite the convergence of the proposed algorithm and show that the algorithm has (?????) iteration complexity bound for the Nesterov-Todd direction.