Arc-search interior-point methods (IPMs) are a class of IPMs that utilize an ellipsoidal arc to approximate the central path. On the other hand, inexact IPMs solve the linear equation system for the search direction inexactly at each iteration. In this paper, we propose an inexact infeasible arc-search interior-point method. We establish that the proposed method is a polynomial-time algorithm and we show that its iteration complexity is lower than an inexact infeasible line-search IPM. We conducted
numerical experiments with benchmark problems from NETLIB. The numerical results demonstrate that the proposed method can reduce the number of iterations and the computation time compared to an existing inexact line-search IPM.
Citation
https://arxiv.org/abs/2403.18155