摘要
In this paper,we propose an interior-point algorithm based on a wide neighborhood for convex quadratic semidefinite optimization problems.Using the Nesterov–Todd direction as the search direction,we prove the convergence analysis and obtain the polynomial complexity bound of the proposed algorithm.Although the algorithm belongs to the class of large-step interior-point algorithms,its complexity coincides with the best iteration bound for short-step interior-point algorithms.The algorithm is also implemented to demonstrate that it is efficient.
