A Penalty-Free Method with Trust Region for Nonlinear Semidefinite Programming

In this paper, we propose a class of new penalty-free method, which does not use any penalty function or a filter, to solve nonlinear semidefinite programming (NSDP). So the choice of the penalty parameter and the storage of filter set are avoided. The new method adopts trust region framework to compute a trial step. The trial step is then either accepted or rejected based on the some acceptable criteria which depends on reductions attained in the nonlinear objective function and in the measure of constraint infeasibility. Under the suitable assumptions, we prove that the algorithm is well defined and globally convergent. Finally, the preliminary numerical results are reported.