论文信息 - Nonmonotone trust region algorithm for unconstrained optimization problems

Nonmonotone trust region algorithm for unconstrained optimization problems

Abstract In this paper, a nonmonotone trust region algorithm for unconstrained optimization problems is presented. In the algorithm, a kind of nonmonotone technique, which is evidently different from Grippo, Lampariello and Lucidi’s approach, is used. Under mild conditions, global and local convergence results of the algorithm are established. Preliminary numerical results show that the new algorithm is efficient.

Wu Qing-jun

[1] L. Grippo,et al. A nonmonotone line search technique for Newton's method , 1986 .

[2] Xiang-Sun Zhang,et al. A nonmonotone adaptive trust region method and its convergence , 2003 .

[3] T. Steihaug. The Conjugate Gradient Method and Trust Regions in Large Scale Optimization , 1983 .

[4] Luigi Grippo,et al. Nonmonotone Globalization Techniques for the Barzilai-Borwein Gradient Method , 2002, Comput. Optim. Appl..

[5] Wenyu Sun,et al. Nonmonotone adaptive trust-region method for unconstrained optimization problems , 2005, Appl. Math. Comput..

[6] Yi Xiao,et al. Nonmonotone trust region methods with curvilinear path in unconstrained optimization , 1992, Computing.

[7] Jiangtao Mo,et al. A nonmonotone trust region method based on nonincreasing technique of weighted average of the successive function values , 2007 .

[8] Ya-Xiang Yuan. Advances in Nonlinear Programming , 1998 .

[9] Jorge J. Moré,et al. Testing Unconstrained Optimization Software , 1981, TOMS.

[10] William W. Hager,et al. A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization , 2004, SIAM J. Optim..

[11] N. Deng,et al. Nonmonotonic trust region algorithm , 1993 .

[12] Philippe L. Toint,et al. Non-monotone trust-region algorithms for nonlinear optimization subject to convex constraints , 1997, Math. Program..