A modified SLP algorithm and its global convergence |
| |
Authors: | Aiqun Huang Chengxian Xu |
| |
Institution: | a Department of Mathematics of School of Science, Xi’an Jiaotong University, Xi’an, 710049, PR Chinab SKLMSE Lab. and Department of Mathematics of School of Science, Xi’an Jiaotong University, Xi’an, 710049, PR China |
| |
Abstract: | This paper concerns a filter technique and its application to the trust region method for nonlinear programming (NLP) problems. We used our filter trust region algorithm to solve NLP problems with equality and inequality constraints, instead of solving NLP problems with just inequality constraints, as was introduced by Fletcher et al. R. Fletcher, S. Leyffer, Ph.L. Toint, On the global converge of an SLP-filter algorithm, Report NA/183, Department of Mathematics, Dundee University, Dundee, Scotland, 1999]. We incorporate this filter technique into the traditional trust region method such that the new algorithm possesses nonmonotonicity. Unlike the tradition trust region method, our algorithm performs a nonmonotone filter technique to find a new iteration point if a trial step is not accepted. Under mild conditions, we prove that the algorithm is globally convergent. |
| |
Keywords: | 90C30 90C55 49M30 |
本文献已被 ScienceDirect 等数据库收录! |
|