An efficient primal-dual interior point algorithm for linear optimization problems based on a new parameterized Kernel function with a logarithmic barrier term

Abstract

In this paper, we present a primal-dual interior point method for linear optimization problems based on a new Kernel function with on a new parameterized logarithmic barrier term. We prove that the proposed kernel function belongs to the eligible class. We derive the complexity bounds for large and small-update methods respectively.