Journal of Inequalities and Applications 
Volume 2008 (2008), Article ID 218345, 10 pages
doi:10.1155/2008/218345
Research Article

A Note on Convergence Analysis of an SQP-Type Method for Nonlinear Semidefinite Programming

Yun Wang,1 Shaowu Zhang,2 and Liwei Zhang1

 1Department of Applied Mathematics, Dalian University of Technology, Dalian 116024, China
2Department of Computer Science, Dalian University of Technology, Dalian 116024, China
Received 29 August 2007; Accepted 23 November 2007

Recommended by Kok Lay Teo

Abstract

We reinvestigate the convergence properties of the SQP-type method for solving nonlinear semidefinite programming problems studied by Correa and Ramirez (2004). We prove, under the strong second-order sufficient condition with the sigma term, that the local SQP-type method is quadratically convergent and the line search SQP-type method is globally convergent.