Title of article
A new norm-relaxed SQP algorithm with global convergence
Author/Authors
Zheng، نويسنده , , Hai-Yan and Jian، نويسنده , , Jin-Bao and Tang، نويسنده , , Chun-Ming and Quan، نويسنده , , Ran، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2010
Pages
6
From page
670
To page
675
Abstract
A new norm-relaxed sequential quadratic programming algorithm with global convergence for inequality constrained problem is presented in this paper, and the quadratic programming subproblem can be solved at each iteration. Without the boundedness assumptions on any of the iterative sequences, the global convergence can be guaranteed by line search with l ∞ penalty function and under some mild assumptions.
Keywords
l ? penalty function , global convergence , Norm-relaxed SQP
Journal title
Applied Mathematics Letters
Serial Year
2010
Journal title
Applied Mathematics Letters
Record number
1526896
Link To Document