摘要

This paper proposes a dwindling filter line search algorithm for nonlinear equality constrained optimization. A dwindling filter, which is a modification of the traditional filter, is employed in the algorithm. The envelope of the dwindling filter becomes thinner and thinner as the step size approaches zero. This new algorithm has more flexibility for the acceptance of the trial step and requires less computational costs compared with traditional filter algorithm. The global and local convergence of the proposed algorithm are given under some reasonable conditions. The numerical experiments are reported to show the effectiveness of the dwindling filter algorithm.