A globally convergent QP-free algorithm for nonlinear semidefinite programming

Abstract

Abstract In this paper, we present a QP-free algorithm for nonlinear semidefinite programming. At each iteration, the search direction is yielded by solving two systems of linear equations with the same coefficient matrix; l 1 $l_{1}$ penalty function is used as merit function for line search, the step size is determined by Armijo type inexact line search. The global convergence of the proposed algorithm is shown under suitable conditions. Preliminary numerical results are reported.

Keywords

• nonlinear semidefinite programmming
• KKT conditions
• QP-free algorithm
• global convergence