A note on convergence analysis of an SQP-type method for nonlinear semidefinite programming

Indexed by:期刊论文

Journal:JOURNAL OF INEQUALITIES AND APPLICATIONS

Included Journals:SCIE

ISSN No.:1029-242X

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.
   Copyright (c) 2008 Yun Wang et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Date of Publication:2008-01-01