Interior-point methods for linear optimization based on a kernel function with a trigonometric barrier term

In this paper, we present a new barrier function for primal-dual interior-point methods in linear optimization. The proposed kernel function has a trigonometric barrier term. It is shown that in the interior-point methods based on this function for large-update methods, the iteration bound is improved significantly. For small-update interior-point methods, the iteration bound is the best currently known bound for primal-dual interior-point methods.