Abstract: In this paper, an interior point algorithm for linear optimization problem based on a kernel function which has trigonometric function in its barrier term is proposed. By means of some simple analysis tools, we show that our algorithm in large neighborhood of the central path has the best known iteration complexity bound.