An O(r(cond(G))1/4log¼ϵ−1) iteration predictor–corrector interior-point method with a new one-norm neighbourhood for symmetric cone optimization

In this paper, we propose a predictor–corrector interior-point method for symmetric cone optimization. The proposed algorithm is based on a new one-norm neighbourhood, which is an even wider neighbourhood than a given negative infinity neighbourhood. The convergence is shown for a commutative class...

Full description

Saved in:
Bibliographic Details
Published in:Optimization 2022-12, Vol.71 (12), p.3419-3437
Main Authors: Shahraki, M. Sayadi, Mansouri, H.
Format: Article
Language:English
Subjects:
Algorithms
Complexity
Iterative methods
Optimization
Predictor-corrector methods
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this paper, we propose a predictor–corrector interior-point method for symmetric cone optimization. The proposed algorithm is based on a new one-norm neighbourhood, which is an even wider neighbourhood than a given negative infinity neighbourhood. The convergence is shown for a commutative class of search directions, which includes the Nesterov–Todd direction and the xs and sx directions. We show that the algorithm has iteration complexity bound which is better than that of the usual wide neighbourhood algorithm . To our knowledge, these are the best complexity results obtained so far for the solution of symmetric cone optimization. We prove that beside the predictor steps, each corrector step also reduces the duality gap by a rate of . Finally, numerical experiments show that the proposed algorithm is efficient and reliable.
ISSN:0233-1934
1029-4945
DOI:10.1080/02331934.2021.1899177