55
Views
0
CrossRef citations to date
0
Altmetric
Original Articles

An predictor–corrector interior-point algorithm for semidefinite optimization based on a wide neighbourhood

ORCID Icon &
Pages 414-433 | Received 26 Mar 2017, Accepted 23 Mar 2020, Published online: 11 Apr 2020
 

Abstract

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.

2010 Mathematics Subject Classifications:

Acknowledgments

The authors would like to thank the Editors and the anonymous referees for their useful comments and suggestions, which helped to improve the presentation of this paper.

Disclosure statement

No potential conflict of interest was reported by the authors.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.