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

被引：0
|
作者：
Yun Wang
Shaowu Zhang
Liwei Zhang
机构：
[1] Dalian University of Technology,Department of Applied Mathematics
[2] Dalian University of Technology,Department of Computer Science
来源：
Journal of Inequalities and Applications | / 2008卷
关键词：
Line Search; Merit Function; Constraint Qualification; Augmented Lagrangian Method; Nondegeneracy Condition;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
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.
引用
收藏
相关论文
共 50 条
12345