scholarly journals Global and local convergence of a penalty-free method for nonlinear programming

2013 ◽  
Vol 65 (4) ◽  
pp. 589-608 ◽  
Author(s):  
Zhongwen Chen ◽  
Songqiang Qiu
2007 ◽  
Vol 22 (3) ◽  
pp. 365-390 ◽  
Author(s):  
Choong Ming Chin ◽  
Abdul Halim Abdul Rashid ◽  
Khalid Mohamed Nor

2003 ◽  
Vol 14 (1) ◽  
pp. 173-199 ◽  
Author(s):  
André L. Tits ◽  
Andreas Wächter ◽  
Sasan Bakhtiari ◽  
Thomas J. Urban ◽  
Craig T. Lawrence

2012 ◽  
Vol 40 (1-2) ◽  
pp. 261-275 ◽  
Author(s):  
Meiling Liu ◽  
Xueqian Li ◽  
Dingguo Pu

2012 ◽  
Vol 2012 ◽  
pp. 1-20 ◽  
Author(s):  
Meiling Liu ◽  
Xueqian Li ◽  
Qinmin Wu

A filter algorithm with inexact line search is proposed for solving nonlinear programming problems. The filter is constructed by employing the norm of the gradient of the Lagrangian function to the infeasibility measure. Transition to superlinear local convergence is showed for the proposed filter algorithm without second-order correction. Under mild conditions, the global convergence can also be derived. Numerical experiments show the efficiency of the algorithm.


Sign in / Sign up

Export Citation Format

Share Document