Extension of a projective interior point method for linearly constrained convex programming

In this paper, we propose an interior point method of type projective to minimize a nonlinear function under linear constraints. We combine the approach of linearization with ingredients brought by Karmarkar. The theoretical results deduct of those established later.