An interior method for nonconvex semidefinite programs

In several applications, semidefinite programs arise in which the matrix depends nonlinearly on the unknown variables. We propose a new solution method for such semidefinite programs that also applies to other smooth nonconvex programs. The method is an extension of a primal predictor corrector interior method to nonconvex programs. The predictor steps are based on Dikin ellipsoids of a ‘convexified’ domain. The corrector steps are based on quadratic subprograms that combine aspects of line search and trust region methods. Convergence results are given, and some preliminary numerical experiments suggest a high robustness of the proposed method.