Full Text: PDF
Received September 25, 2018; Accepted March 10, 2019; Published March 23, 2019
Abstract. In this paper, we present an efficient two phases primal-dual interior point algorithm without line search for semidefinite optimization problems. We propose three new alternatives which give an effective displacement step and improve the behavior of the algorithm. Moreover, we also present some numerical experiments which show the efficiency of our algorithm.
How to Cite this Article:
Zerari Amina, Benterki Djamel, A new efficient primal-dual projective interior point method for semidefinite programming, Journal of Nonlinear Functional Analysis, Vol. 2019 (2019), Article ID 12, pp. 1-12.