![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 corrector–predictor path-following interior-point method for second-order cone optimization (SOCO) based on a new proximity measure. The algorithm produces a sequence of iterates in a neighbourhood of the central path based on a new proximity measure. We show that the algorithm is well-defined and derive the complexity bound for the algorithm. We obtain the best-known result for SOCO. The numerical results show that the proposed algorithm is effective.
2010 AMS Subject Classification:
Disclosure statement
No potential conflict of interest was reported by the authors.