Dual interior point methods for linear semidefinite programming problems

Abstract

Dual interior point methods for solving linear semidefinite programming problems are proposed. These methods are an extension of dual barrier-projection methods for linear programs. It is shown that the proposed methods converge locally at a linear rate provided that the solutions to the primal and dual problems are nondegenerate.