Méthodes de points intérieurs et leurs applications sur des problèmes d'optimisation semi-définis
Loading...
Date
Journal Title
Journal ISSN
Volume Title
Publisher
Université Sétif 1 - Ferhat ABBAS , Faculté de Technologie
Abstract
Interior point methods are well known as the most efficient to solve optimization problems. These methods have a polynomial convergence and good behavior. In this research, we are interested in a theoretical, numerical and an algorithmic study of interior-point methods for semidefinite programming.
Indeed, we present in a first part, a primal-dual projective interior point algorithm of polynomial type with two phases, where we introduced three new effective alternatives for computing the displacement step.
Then, in the second part, we are interested in a primal-dual central trajectory method via a kernel function, we proposed two new kernel functions with a logarithmic term that give the best-known complexity results.
