Journal
INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS
Volume 98, Issue 2, Pages 414-433Publisher
TAYLOR & FRANCIS LTD
DOI: 10.1080/00207160.2020.1748604
Keywords
Semidefinite optimization; predictor-corrector interior-point method; wide neighbourhood; polynomial complexity
Categories
Ask authors/readers for more resources
This paper introduces a new predictor-corrector interior-point algorithm for semidefinite optimization, demonstrating that both predictor and corrector steps contribute to decreasing the duality gap. The proposed algorithm's iteration complexity aligns with the best iteration bound for small neighbourhood algorithms using the Nesterov-Todd direction, and numerical results are provided as well.
In this paper, we propose a new predictor-corrector interior-point algorithm for semidefinite optimization based on a wide neighbourhood of the central path. We show that, in addition to the predictor step, each corrector step decreases the duality gap as well. We also prove that the iteration complexity of the proposed algorithm coincides with the best iteration bound for small neighbourhood algorithms that use the Nesterov-Todd direction. Finally, some numerical results are provided as well.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available