Exploiting structure in a projective algorithm for solving strict linear matrix inequalities

This paper focuses on exploiting structure in a Lyapunov type linear matrix inequality when solving a strict feasibility problem or a semidefinite programming problem using projective methods. A projective algorithm by Nemirovskii and Gahinet (1994) is modified so that both time and space complexity can be reduced.