| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 1709126 | Applied Mathematics Letters | 2010 | 6 Pages |
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∞l∞ penalty function and under some mild assumptions.
Keywords
Related Topics
Physical Sciences and Engineering
Engineering
Computational Mechanics
Authors
Hai-Yan Zheng, Jin-Bao Jian, Chun-Ming Tang, Ran Quan,