Finding a strict feasible solution of a linear semidefinite program

摘要

This study deals with the performance of projective interior point methods for linear semidefinite program. We propose a modification in the initialization phases of the method in order to reduce the computation time.This purpose is confirmed by numerical experiments showing the efficiency which are presented in the last section of the paper.