A method projective for solution of a quadratic semidefinite problem with a new potential function

Abstract

In this paper, we are interested in a primal-dual algorithmic study of a projective interior point method of a semidefinite quadratic problem (QSDP). In the first instance, we suggested a new projective function to have a set of simplex like constraints and a linearization of the objectif function, in the second time we have defined a new potential function to obtain a new polynomial complexity, such that the convergence is obtained after O(L(n+1)) iterations bound.