A Full-Newton Step Interior-point Method Based on a Class of Specific Algebra Transformation

We present a primal-dual path-following interior-point method for linear optimization that is based on the integer powers of the square root function. Our derived search directions is a generalization of the standard directions and the search directions given by Darvay. The proposed algorithm uses only full steps and hence no need to perform line search. We first prove that the iterates lie in the quadratic convergence neighborhood of the proximity measure and then derive the iteration-complexity bound for the algorithm.