A Filter Algorithm with Inexact Line Search
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 a...
Main Authors: | Meiling Liu, Xueqian Li, Qinmin Wu |
---|---|
Format: | Article |
Language: | English |
Published: |
Hindawi Limited
2012-01-01
|
Series: | Mathematical Problems in Engineering |
Online Access: | http://dx.doi.org/10.1155/2012/349178 |
Similar Items
-
Modification of the Dai-Yuan method with inexact line search
by: Shao-Wei Sung, et al.
Published: (2005) -
The global proof of the Polak–Ribière–Polak algorithm under the YWL inexact line search technique
by: Xiangrong Li, et al.
Published: (2019-07-01) -
Inexact searches on the L-curve
by: Hugo Lara Urdaneta, et al.
Published: (2009-09-01) -
Inexact searches on the L-curve
Published: (2009-09-01) -
A New Preconditioned Inexact Line-Search Technique for Unconstrained Optimization
by: Abbas Al-Bayati, et al.
Published: (2012-12-01)