http://orcid.org/0000-0003-1094-9837
![Sample our Computer Science journals, sign in here to start your access, latest two full volumes FREE to you for 14 days]({"type":"image" , "src" : "/sda/5928/TOC-Subject-Sample-2021-Computer-Science.jpg"})
ABSTRACT
In this paper, we present a feasible predictor–corrector interior-point method for symmetric cone optimization problem in the large neighbourhood of the central path. The method is generalization of Ai-Zhang's predictor–corrector algorithm to the symmetric cone optimization problem. Starting with a feasible point in given large neighbourhood of the central path, the algorithm still terminates in at most
iterations. This matches the best known iteration bound that is usually achieved by short-step methods, thereby, closing the complexity gap between long- and short-step interior-point methods for symmetric cone optimization. The preliminary numerical results on a selected set of NETLIB problems show advantage of the method in comparison with the version of the algorithm that is not based on the predictor–corrector scheme.
Acknowledgments
The authors are grateful to the referees and the editor for their valuable suggestions on the paper.
Disclosure statement
No potential conflict of interest was reported by the authors.
ORCID
Zs. Darvay http://orcid.org/0000-0003-1094-9837