Limiting behavior and analyticity of two special types of infeasible
weighted central paths in semidefinite programming
Acta mathematica Universitatis Comenianae, Tome 79 (2010) no. 1
Citer cet article
Voir la notice de l'article provenant de la source Comenius University
The central path is the most important concept in the theory of interior point methods. It is an analytic curve in the interior of the feasible set which tends to an optimal point at the boundary. The analyticity properties of the paths are connected to the analysis of the superlinear convergence of the interior point algorithms for semidefinite programming. In this paper we study the analyticity of two special types of weighted central paths in semidefinite programming, under the condition of the existence of the strictly complementary solution.