It is well known that each kernel function defines primal-dual interior-point method (IPM). Most of polynomial-time interior-point algorithms for linear optimization (LO) are based on the logarithmic kernel function ([9]). In this paper we define new eligible kernel function and propose a new search direction and proximity function based on this function for LO problems. We show that the new algorithm has $mathcal{O}(({log};p)^{frac{5}{2}}sqrt{n}{log};n;{log}frac{n}{epsilon})$ and $mathcal{O}(q^{frac{3}{2}}({log};p)^3sqrt{n}{log};frac{n}{epsilon})$ iteration complexity for large- and small-update methods, respectively. These are currently the best known complexity results for such methods.