A modified SLP algorithm and its global convergence

A modified SLP algorithm and its global convergence,10.1016/,Journal of Computational and Applied Mathematics,Aiqun Huang,Chengxian X

A modified SLP algorithm and its global convergence  
BibTex | RIS | RefWorks Download
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.
Journal: Journal of Computational and Applied Mathematics - J COMPUT APPL MATH , vol. 235, no. 14, pp. 4302-4307, 2011
Cumulative Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.